Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 7.5K Apr 11 17:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 11 17:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 11 17:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 11 17:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K 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 13K Apr 11 17:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 11 17:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 11 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 11 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717250288047

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S04J06T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:58:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 13:58:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:58:09] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 13:58:09] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 13:58:10] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 603 ms
[2024-06-01 13:58:10] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 618 PT places and 3232.0 transition bindings in 26 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 13:58:10] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 6 ms.
[2024-06-01 13:58:10] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 4 formulas.
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 12 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40000 steps (11 resets) in 2156 ms. (18 steps per ms) remains 7/23 properties
BEST_FIRST walk for 40001 steps (9 resets) in 458 ms. (87 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 163 ms. (243 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (9 resets) in 156 ms. (254 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (10 resets) in 175 ms. (227 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (8 resets) in 236 ms. (168 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (12 resets) in 234 ms. (170 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (8 resets) in 228 ms. (174 steps per ms) remains 7/7 properties
[2024-06-01 13:58:11] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-06-01 13:58:11] [INFO ] Computed 26 invariants in 9 ms
[2024-06-01 13:58:11] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp15 is UNSAT
At refinement iteration 1 (OVERLAPS) 40/50 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 4/54 variables, 3/9 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 5 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp22 is UNSAT
At refinement iteration 5 (OVERLAPS) 19/73 variables, 12/21 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/21 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/78 variables, 3/24 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/78 variables, 0/24 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/79 variables, 1/25 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/79 variables, 0/25 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 64/143 variables, 79/104 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/143 variables, 8/112 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/143 variables, 0/112 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/145 variables, 2/114 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/145 variables, 1/115 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/145 variables, 0/115 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/145 variables, 0/115 constraints. Problems are: Problem set: 6 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 115 constraints, problems are : Problem set: 6 solved, 1 unsolved in 483 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: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/33 variables, 3/3 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/3 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/47 variables, 5/8 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/8 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/51 variables, 1/9 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/9 constraints. Problems are: Problem set: 6 solved, 1 unsolved
Problem AtomicPropp17 is UNSAT
After SMT solving in domain Int declared 73/145 variables, and 21 constraints, problems are : Problem set: 7 solved, 0 unsolved in 116 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/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 661ms problems are : Problem set: 7 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 7 atomic propositions for a total of 12 simplifications.
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 13:58:12] [INFO ] Flatten gal took : 45 ms
[2024-06-01 13:58:12] [INFO ] Flatten gal took : 8 ms
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-06-01 13:58:12] [INFO ] Unfolded HLPN to a Petri net with 618 places and 3190 transitions 21570 arcs in 93 ms.
[2024-06-01 13:58:12] [INFO ] Unfolded 10 HLPN properties in 0 ms.
Ensure Unique test removed 1626 transitions
Reduce redundant transitions removed 1626 transitions.
Support contains 182 out of 618 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 618/618 places, 1564/1564 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 612 transition count 1558
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 612 transition count 1558
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 606 transition count 1552
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 606 transition count 1552
Applied a total of 24 rules in 94 ms. Remains 606 /618 variables (removed 12) and now considering 1552/1564 (removed 12) transitions.
Running 1548 sub problems to find dead transitions.
[2024-06-01 13:58:12] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
// Phase 1: matrix 1528 rows 606 cols
[2024-06-01 13:58:13] [INFO ] Computed 54 invariants in 92 ms
[2024-06-01 13:58:13] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/598 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/598 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-06-01 13:58:31] [INFO ] Deduced a trap composed of 81 places in 153 ms of which 20 ms to minimize.
[2024-06-01 13:58:31] [INFO ] Deduced a trap composed of 81 places in 118 ms of which 2 ms to minimize.
[2024-06-01 13:58:32] [INFO ] Deduced a trap composed of 81 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:58:32] [INFO ] Deduced a trap composed of 81 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:58:32] [INFO ] Deduced a trap composed of 81 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:58:32] [INFO ] Deduced a trap composed of 349 places in 310 ms of which 4 ms to minimize.
[2024-06-01 13:58:33] [INFO ] Deduced a trap composed of 332 places in 306 ms of which 4 ms to minimize.
[2024-06-01 13:58:33] [INFO ] Deduced a trap composed of 139 places in 282 ms of which 3 ms to minimize.
[2024-06-01 13:58:33] [INFO ] Deduced a trap composed of 159 places in 382 ms of which 6 ms to minimize.
[2024-06-01 13:58:34] [INFO ] Deduced a trap composed of 311 places in 415 ms of which 4 ms to minimize.
[2024-06-01 13:58:35] [INFO ] Deduced a trap composed of 327 places in 397 ms of which 4 ms to minimize.
[2024-06-01 13:58:35] [INFO ] Deduced a trap composed of 337 places in 341 ms of which 4 ms to minimize.
[2024-06-01 13:58:36] [INFO ] Deduced a trap composed of 63 places in 235 ms of which 3 ms to minimize.
[2024-06-01 13:58:36] [INFO ] Deduced a trap composed of 82 places in 84 ms of which 1 ms to minimize.
[2024-06-01 13:58:37] [INFO ] Deduced a trap composed of 370 places in 463 ms of which 5 ms to minimize.
[2024-06-01 13:58:38] [INFO ] Deduced a trap composed of 351 places in 390 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 598/2134 variables, and 62 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20066 ms.
Refiners :[Positive P Invariants (semi-flows): 15/19 constraints, Generalized P Invariants (flows): 31/35 constraints, State Equation: 0/606 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/598 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/598 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/598 variables, 16/62 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-06-01 13:58:48] [INFO ] Deduced a trap composed of 293 places in 433 ms of which 5 ms to minimize.
[2024-06-01 13:58:49] [INFO ] Deduced a trap composed of 314 places in 348 ms of which 5 ms to minimize.
[2024-06-01 13:58:49] [INFO ] Deduced a trap composed of 288 places in 374 ms of which 5 ms to minimize.
[2024-06-01 13:58:50] [INFO ] Deduced a trap composed of 362 places in 403 ms of which 5 ms to minimize.
[2024-06-01 13:58:50] [INFO ] Deduced a trap composed of 366 places in 313 ms of which 5 ms to minimize.
[2024-06-01 13:58:52] [INFO ] Deduced a trap composed of 92 places in 159 ms of which 3 ms to minimize.
[2024-06-01 13:58:52] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 598/2134 variables, and 69 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 15/19 constraints, Generalized P Invariants (flows): 31/35 constraints, State Equation: 0/606 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 23/23 constraints]
After SMT, in 45174ms problems are : Problem set: 0 solved, 1548 unsolved
Search for dead transitions found 0 dead transitions in 45235ms
[2024-06-01 13:58:58] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-06-01 13:58:58] [INFO ] Invariant cache hit.
[2024-06-01 13:58:58] [INFO ] Implicit Places using invariants in 412 ms returned [484, 485, 486, 487, 488, 489]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 423 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 600/618 places, 1552/1564 transitions.
Applied a total of 0 rules in 21 ms. Remains 600 /600 variables (removed 0) and now considering 1552/1552 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 45795 ms. Remains : 600/618 places, 1552/1564 transitions.
Support contains 182 out of 600 places after structural reductions.
[2024-06-01 13:58:58] [INFO ] Flatten gal took : 169 ms
[2024-06-01 13:58:58] [INFO ] Flatten gal took : 134 ms
[2024-06-01 13:58:59] [INFO ] Input system was already deterministic with 1552 transitions.
Support contains 175 out of 600 places (down from 182) after GAL structural reductions.
RANDOM walk for 40000 steps (12 resets) in 831 ms. (48 steps per ms) remains 4/19 properties
BEST_FIRST walk for 40003 steps (8 resets) in 255 ms. (156 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 157 ms. (253 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 188 ms. (211 steps per ms) remains 4/4 properties
[2024-06-01 13:58:59] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
// Phase 1: matrix 1528 rows 600 cols
[2024-06-01 13:58:59] [INFO ] Computed 48 invariants in 46 ms
[2024-06-01 13:58:59] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp18 is UNSAT
At refinement iteration 1 (OVERLAPS) 7/31 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem AtomicPropp9 is UNSAT
At refinement iteration 3 (OVERLAPS) 427/458 variables, 13/14 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/458 variables, 0/14 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Problem AtomicPropp5 is UNSAT
At refinement iteration 5 (OVERLAPS) 58/516 variables, 15/29 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 0/29 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Problem AtomicPropp15 is UNSAT
After SMT solving in domain Real declared 597/2128 variables, and 46 constraints, problems are : Problem set: 4 solved, 0 unsolved in 247 ms.
Refiners :[Positive P Invariants (semi-flows): 16/18 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/600 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 309ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 4 atomic propositions for a total of 10 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((G((p0 U p1))&&F(G(p2)))))'
Support contains 60 out of 600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 600/600 places, 1552/1552 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 596 transition count 1552
Applied a total of 4 rules in 40 ms. Remains 596 /600 variables (removed 4) and now considering 1552/1552 (removed 0) transitions.
Running 1548 sub problems to find dead transitions.
[2024-06-01 13:59:00] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
// Phase 1: matrix 1528 rows 596 cols
[2024-06-01 13:59:00] [INFO ] Computed 44 invariants in 51 ms
[2024-06-01 13:59:00] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-06-01 13:59:17] [INFO ] Deduced a trap composed of 82 places in 124 ms of which 1 ms to minimize.
[2024-06-01 13:59:17] [INFO ] Deduced a trap composed of 82 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:59:17] [INFO ] Deduced a trap composed of 82 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:59:17] [INFO ] Deduced a trap composed of 82 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:59:17] [INFO ] Deduced a trap composed of 82 places in 77 ms of which 2 ms to minimize.
[2024-06-01 13:59:18] [INFO ] Deduced a trap composed of 398 places in 353 ms of which 5 ms to minimize.
[2024-06-01 13:59:18] [INFO ] Deduced a trap composed of 359 places in 335 ms of which 3 ms to minimize.
[2024-06-01 13:59:18] [INFO ] Deduced a trap composed of 348 places in 293 ms of which 4 ms to minimize.
[2024-06-01 13:59:19] [INFO ] Deduced a trap composed of 139 places in 312 ms of which 4 ms to minimize.
[2024-06-01 13:59:19] [INFO ] Deduced a trap composed of 82 places in 321 ms of which 4 ms to minimize.
[2024-06-01 13:59:19] [INFO ] Deduced a trap composed of 160 places in 305 ms of which 4 ms to minimize.
[2024-06-01 13:59:20] [INFO ] Deduced a trap composed of 304 places in 390 ms of which 6 ms to minimize.
[2024-06-01 13:59:21] [INFO ] Deduced a trap composed of 328 places in 363 ms of which 4 ms to minimize.
[2024-06-01 13:59:22] [INFO ] Deduced a trap composed of 429 places in 298 ms of which 4 ms to minimize.
[2024-06-01 13:59:22] [INFO ] Deduced a trap composed of 366 places in 426 ms of which 3 ms to minimize.
[2024-06-01 13:59:23] [INFO ] Deduced a trap composed of 375 places in 369 ms of which 3 ms to minimize.
[2024-06-01 13:59:23] [INFO ] Deduced a trap composed of 355 places in 316 ms of which 5 ms to minimize.
[2024-06-01 13:59:24] [INFO ] Deduced a trap composed of 371 places in 376 ms of which 3 ms to minimize.
[2024-06-01 13:59:24] [INFO ] Deduced a trap composed of 340 places in 324 ms of which 3 ms to minimize.
[2024-06-01 13:59:24] [INFO ] Deduced a trap composed of 358 places in 450 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2124 variables, and 60 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-06-01 13:59:29] [INFO ] Deduced a trap composed of 41 places in 209 ms of which 3 ms to minimize.
[2024-06-01 13:59:35] [INFO ] Deduced a trap composed of 382 places in 355 ms of which 4 ms to minimize.
[2024-06-01 13:59:35] [INFO ] Deduced a trap composed of 362 places in 339 ms of which 4 ms to minimize.
[2024-06-01 13:59:38] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 592/2124 variables, and 64 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 24/24 constraints]
After SMT, in 45652ms problems are : Problem set: 0 solved, 1548 unsolved
Search for dead transitions found 0 dead transitions in 45686ms
[2024-06-01 13:59:46] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-06-01 13:59:46] [INFO ] Invariant cache hit.
[2024-06-01 13:59:46] [INFO ] Implicit Places using invariants in 478 ms returned []
[2024-06-01 13:59:46] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-06-01 13:59:46] [INFO ] Invariant cache hit.
[2024-06-01 13:59:47] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:59:54] [INFO ] Implicit Places using invariants and state equation in 8042 ms returned []
Implicit Place search using SMT with State Equation took 8522 ms to find 0 implicit places.
Running 1548 sub problems to find dead transitions.
[2024-06-01 13:59:54] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-06-01 13:59:54] [INFO ] Invariant cache hit.
[2024-06-01 13:59:54] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-06-01 14:00:11] [INFO ] Deduced a trap composed of 82 places in 77 ms of which 2 ms to minimize.
[2024-06-01 14:00:11] [INFO ] Deduced a trap composed of 82 places in 72 ms of which 2 ms to minimize.
[2024-06-01 14:00:11] [INFO ] Deduced a trap composed of 82 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:00:11] [INFO ] Deduced a trap composed of 82 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:00:11] [INFO ] Deduced a trap composed of 82 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:00:12] [INFO ] Deduced a trap composed of 360 places in 337 ms of which 5 ms to minimize.
[2024-06-01 14:00:12] [INFO ] Deduced a trap composed of 359 places in 345 ms of which 5 ms to minimize.
[2024-06-01 14:00:13] [INFO ] Deduced a trap composed of 263 places in 336 ms of which 3 ms to minimize.
[2024-06-01 14:00:13] [INFO ] Deduced a trap composed of 82 places in 97 ms of which 2 ms to minimize.
[2024-06-01 14:00:14] [INFO ] Deduced a trap composed of 288 places in 396 ms of which 7 ms to minimize.
[2024-06-01 14:00:16] [INFO ] Deduced a trap composed of 362 places in 454 ms of which 8 ms to minimize.
[2024-06-01 14:00:16] [INFO ] Deduced a trap composed of 362 places in 463 ms of which 5 ms to minimize.
[2024-06-01 14:00:17] [INFO ] Deduced a trap composed of 355 places in 425 ms of which 4 ms to minimize.
[2024-06-01 14:00:17] [INFO ] Deduced a trap composed of 350 places in 419 ms of which 5 ms to minimize.
[2024-06-01 14:00:17] [INFO ] Deduced a trap composed of 342 places in 390 ms of which 4 ms to minimize.
[2024-06-01 14:00:18] [INFO ] Deduced a trap composed of 330 places in 349 ms of which 4 ms to minimize.
[2024-06-01 14:00:18] [INFO ] Deduced a trap composed of 339 places in 344 ms of which 4 ms to minimize.
[2024-06-01 14:00:18] [INFO ] Deduced a trap composed of 305 places in 326 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2124 variables, and 58 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-06-01 14:00:32] [INFO ] Deduced a trap composed of 334 places in 378 ms of which 5 ms to minimize.
[2024-06-01 14:00:33] [INFO ] Deduced a trap composed of 169 places in 228 ms of which 2 ms to minimize.
[2024-06-01 14:00:39] [INFO ] Deduced a trap composed of 366 places in 353 ms of which 4 ms to minimize.
[2024-06-01 14:00:39] [INFO ] Deduced a trap composed of 366 places in 331 ms of which 4 ms to minimize.
[2024-06-01 14:00:42] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 3 ms to minimize.
[2024-06-01 14:00:50] [INFO ] Deduced a trap composed of 414 places in 386 ms of which 4 ms to minimize.
[2024-06-01 14:00:51] [INFO ] Deduced a trap composed of 65 places in 393 ms of which 5 ms to minimize.
[2024-06-01 14:00:52] [INFO ] Deduced a trap composed of 42 places in 380 ms of which 4 ms to minimize.
[2024-06-01 14:00:57] [INFO ] Deduced a trap composed of 358 places in 361 ms of which 5 ms to minimize.
[2024-06-01 14:00:57] [INFO ] Deduced a trap composed of 313 places in 342 ms of which 4 ms to minimize.
[2024-06-01 14:00:57] [INFO ] Deduced a trap composed of 291 places in 312 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 592/2124 variables, and 69 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 29/29 constraints]
After SMT, in 65429ms problems are : Problem set: 0 solved, 1548 unsolved
Search for dead transitions found 0 dead transitions in 65451ms
Starting structural reductions in LTL mode, iteration 1 : 596/600 places, 1552/1552 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 119717 ms. Remains : 596/600 places, 1552/1552 transitions.
Stuttering acceptance computed with spot in 384 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : PolyORBLF-COL-S04J06T06-LTLCardinality-02
Stuttering criterion allowed to conclude after 20726 steps with 0 reset in 121 ms.
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S04J06T06-LTLCardinality-02 finished in 120320 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G(p1))))'
Support contains 31 out of 600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 600/600 places, 1552/1552 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 596 transition count 1552
Applied a total of 4 rules in 16 ms. Remains 596 /600 variables (removed 4) and now considering 1552/1552 (removed 0) transitions.
Running 1548 sub problems to find dead transitions.
[2024-06-01 14:01:00] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-06-01 14:01:00] [INFO ] Invariant cache hit.
[2024-06-01 14:01:00] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-06-01 14:01:17] [INFO ] Deduced a trap composed of 82 places in 74 ms of which 1 ms to minimize.
[2024-06-01 14:01:17] [INFO ] Deduced a trap composed of 82 places in 72 ms of which 2 ms to minimize.
[2024-06-01 14:01:18] [INFO ] Deduced a trap composed of 82 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:01:18] [INFO ] Deduced a trap composed of 82 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:01:18] [INFO ] Deduced a trap composed of 82 places in 81 ms of which 1 ms to minimize.
[2024-06-01 14:01:18] [INFO ] Deduced a trap composed of 360 places in 403 ms of which 5 ms to minimize.
[2024-06-01 14:01:19] [INFO ] Deduced a trap composed of 359 places in 406 ms of which 4 ms to minimize.
[2024-06-01 14:01:19] [INFO ] Deduced a trap composed of 263 places in 323 ms of which 4 ms to minimize.
[2024-06-01 14:01:19] [INFO ] Deduced a trap composed of 82 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:01:20] [INFO ] Deduced a trap composed of 288 places in 350 ms of which 5 ms to minimize.
[2024-06-01 14:01:21] [INFO ] Deduced a trap composed of 362 places in 400 ms of which 5 ms to minimize.
[2024-06-01 14:01:22] [INFO ] Deduced a trap composed of 362 places in 392 ms of which 4 ms to minimize.
[2024-06-01 14:01:22] [INFO ] Deduced a trap composed of 355 places in 384 ms of which 4 ms to minimize.
[2024-06-01 14:01:23] [INFO ] Deduced a trap composed of 350 places in 395 ms of which 5 ms to minimize.
[2024-06-01 14:01:23] [INFO ] Deduced a trap composed of 342 places in 313 ms of which 3 ms to minimize.
[2024-06-01 14:01:23] [INFO ] Deduced a trap composed of 330 places in 333 ms of which 3 ms to minimize.
[2024-06-01 14:01:24] [INFO ] Deduced a trap composed of 339 places in 287 ms of which 4 ms to minimize.
[2024-06-01 14:01:24] [INFO ] Deduced a trap composed of 305 places in 286 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2124 variables, and 58 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-06-01 14:01:27] [INFO ] Deduced a trap composed of 334 places in 245 ms of which 4 ms to minimize.
[2024-06-01 14:01:29] [INFO ] Deduced a trap composed of 169 places in 209 ms of which 2 ms to minimize.
[2024-06-01 14:01:35] [INFO ] Deduced a trap composed of 366 places in 358 ms of which 5 ms to minimize.
[2024-06-01 14:01:35] [INFO ] Deduced a trap composed of 366 places in 346 ms of which 5 ms to minimize.
[2024-06-01 14:01:38] [INFO ] Deduced a trap composed of 15 places in 184 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 592/2124 variables, and 63 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 23/23 constraints]
After SMT, in 45341ms problems are : Problem set: 0 solved, 1548 unsolved
Search for dead transitions found 0 dead transitions in 45367ms
[2024-06-01 14:01:45] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-06-01 14:01:45] [INFO ] Invariant cache hit.
[2024-06-01 14:01:46] [INFO ] Implicit Places using invariants in 373 ms returned []
[2024-06-01 14:01:46] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-06-01 14:01:46] [INFO ] Invariant cache hit.
[2024-06-01 14:01:46] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:01:54] [INFO ] Implicit Places using invariants and state equation in 8029 ms returned []
Implicit Place search using SMT with State Equation took 8419 ms to find 0 implicit places.
Running 1548 sub problems to find dead transitions.
[2024-06-01 14:01:54] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-06-01 14:01:54] [INFO ] Invariant cache hit.
[2024-06-01 14:01:54] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-06-01 14:02:10] [INFO ] Deduced a trap composed of 82 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:02:10] [INFO ] Deduced a trap composed of 82 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:02:10] [INFO ] Deduced a trap composed of 82 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:02:10] [INFO ] Deduced a trap composed of 82 places in 64 ms of which 1 ms to minimize.
[2024-06-01 14:02:10] [INFO ] Deduced a trap composed of 82 places in 77 ms of which 1 ms to minimize.
[2024-06-01 14:02:10] [INFO ] Deduced a trap composed of 360 places in 373 ms of which 4 ms to minimize.
[2024-06-01 14:02:11] [INFO ] Deduced a trap composed of 359 places in 259 ms of which 3 ms to minimize.
[2024-06-01 14:02:11] [INFO ] Deduced a trap composed of 263 places in 324 ms of which 3 ms to minimize.
[2024-06-01 14:02:11] [INFO ] Deduced a trap composed of 82 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:02:12] [INFO ] Deduced a trap composed of 288 places in 418 ms of which 4 ms to minimize.
[2024-06-01 14:02:13] [INFO ] Deduced a trap composed of 362 places in 461 ms of which 4 ms to minimize.
[2024-06-01 14:02:14] [INFO ] Deduced a trap composed of 362 places in 460 ms of which 4 ms to minimize.
[2024-06-01 14:02:15] [INFO ] Deduced a trap composed of 355 places in 608 ms of which 5 ms to minimize.
[2024-06-01 14:02:15] [INFO ] Deduced a trap composed of 350 places in 454 ms of which 5 ms to minimize.
[2024-06-01 14:02:16] [INFO ] Deduced a trap composed of 342 places in 376 ms of which 4 ms to minimize.
[2024-06-01 14:02:16] [INFO ] Deduced a trap composed of 330 places in 314 ms of which 3 ms to minimize.
[2024-06-01 14:02:16] [INFO ] Deduced a trap composed of 339 places in 287 ms of which 3 ms to minimize.
[2024-06-01 14:02:16] [INFO ] Deduced a trap composed of 305 places in 299 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2124 variables, and 58 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-06-01 14:02:31] [INFO ] Deduced a trap composed of 334 places in 303 ms of which 6 ms to minimize.
[2024-06-01 14:02:32] [INFO ] Deduced a trap composed of 169 places in 226 ms of which 2 ms to minimize.
[2024-06-01 14:02:38] [INFO ] Deduced a trap composed of 366 places in 254 ms of which 3 ms to minimize.
[2024-06-01 14:02:38] [INFO ] Deduced a trap composed of 366 places in 350 ms of which 3 ms to minimize.
[2024-06-01 14:02:41] [INFO ] Deduced a trap composed of 15 places in 181 ms of which 3 ms to minimize.
[2024-06-01 14:02:50] [INFO ] Deduced a trap composed of 414 places in 258 ms of which 4 ms to minimize.
[2024-06-01 14:02:51] [INFO ] Deduced a trap composed of 65 places in 408 ms of which 4 ms to minimize.
[2024-06-01 14:02:51] [INFO ] Deduced a trap composed of 42 places in 273 ms of which 3 ms to minimize.
[2024-06-01 14:02:55] [INFO ] Deduced a trap composed of 358 places in 373 ms of which 5 ms to minimize.
[2024-06-01 14:02:55] [INFO ] Deduced a trap composed of 313 places in 261 ms of which 3 ms to minimize.
[2024-06-01 14:02:55] [INFO ] Deduced a trap composed of 291 places in 320 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 11/69 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 592/2124 variables, and 69 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 29/29 constraints]
After SMT, in 65265ms problems are : Problem set: 0 solved, 1548 unsolved
Search for dead transitions found 0 dead transitions in 65298ms
Starting structural reductions in LTL mode, iteration 1 : 596/600 places, 1552/1552 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 119118 ms. Remains : 596/600 places, 1552/1552 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-COL-S04J06T06-LTLCardinality-03
Product exploration explored 100000 steps with 733 reset in 551 ms.
Product exploration explored 100000 steps with 729 reset in 467 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 164 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 517 steps (0 resets) in 5 ms. (86 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 9 factoid took 133 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 14:03:01] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-06-01 14:03:01] [INFO ] Invariant cache hit.
[2024-06-01 14:03:02] [INFO ] [Real]Absence check using 16 positive place invariants in 6 ms returned sat
[2024-06-01 14:03:02] [INFO ] [Real]Absence check using 16 positive and 28 generalized place invariants in 94 ms returned sat
[2024-06-01 14:03:03] [INFO ] [Real]Absence check using state equation in 1203 ms returned sat
[2024-06-01 14:03:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:03:04] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2024-06-01 14:03:04] [INFO ] [Nat]Absence check using 16 positive and 28 generalized place invariants in 57 ms returned sat
[2024-06-01 14:03:06] [INFO ] [Nat]Absence check using state equation in 1858 ms returned sat
[2024-06-01 14:03:06] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:03:06] [INFO ] [Nat]Added 120 Read/Feed constraints in 608 ms returned sat
[2024-06-01 14:03:07] [INFO ] Deduced a trap composed of 82 places in 94 ms of which 1 ms to minimize.
[2024-06-01 14:03:07] [INFO ] Deduced a trap composed of 82 places in 98 ms of which 1 ms to minimize.
[2024-06-01 14:03:07] [INFO ] Deduced a trap composed of 82 places in 134 ms of which 2 ms to minimize.
[2024-06-01 14:03:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1075 ms
[2024-06-01 14:03:08] [INFO ] Computed and/alt/rep : 1098/4213/1080 causal constraints (skipped 444 transitions) in 220 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:587)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:619)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:252)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:958)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 14:03:18] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 12 out of 596 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 1552/1552 transitions.
Applied a total of 0 rules in 15 ms. Remains 596 /596 variables (removed 0) and now considering 1552/1552 (removed 0) transitions.
Running 1548 sub problems to find dead transitions.
[2024-06-01 14:03:18] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-06-01 14:03:18] [INFO ] Invariant cache hit.
[2024-06-01 14:03:18] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-06-01 14:03:35] [INFO ] Deduced a trap composed of 82 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:03:35] [INFO ] Deduced a trap composed of 82 places in 54 ms of which 0 ms to minimize.
[2024-06-01 14:03:35] [INFO ] Deduced a trap composed of 82 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:03:35] [INFO ] Deduced a trap composed of 82 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:03:35] [INFO ] Deduced a trap composed of 82 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:03:35] [INFO ] Deduced a trap composed of 360 places in 257 ms of which 3 ms to minimize.
[2024-06-01 14:03:36] [INFO ] Deduced a trap composed of 359 places in 251 ms of which 3 ms to minimize.
[2024-06-01 14:03:36] [INFO ] Deduced a trap composed of 263 places in 220 ms of which 3 ms to minimize.
[2024-06-01 14:03:36] [INFO ] Deduced a trap composed of 82 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:03:37] [INFO ] Deduced a trap composed of 288 places in 391 ms of which 4 ms to minimize.
[2024-06-01 14:03:38] [INFO ] Deduced a trap composed of 362 places in 412 ms of which 5 ms to minimize.
[2024-06-01 14:03:39] [INFO ] Deduced a trap composed of 362 places in 377 ms of which 3 ms to minimize.
[2024-06-01 14:03:39] [INFO ] Deduced a trap composed of 355 places in 322 ms of which 3 ms to minimize.
[2024-06-01 14:03:39] [INFO ] Deduced a trap composed of 350 places in 378 ms of which 4 ms to minimize.
[2024-06-01 14:03:40] [INFO ] Deduced a trap composed of 342 places in 366 ms of which 3 ms to minimize.
[2024-06-01 14:03:40] [INFO ] Deduced a trap composed of 330 places in 317 ms of which 3 ms to minimize.
[2024-06-01 14:03:40] [INFO ] Deduced a trap composed of 339 places in 296 ms of which 3 ms to minimize.
[2024-06-01 14:03:41] [INFO ] Deduced a trap composed of 305 places in 291 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2124 variables, and 58 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-06-01 14:03:46] [INFO ] Deduced a trap composed of 334 places in 253 ms of which 3 ms to minimize.
[2024-06-01 14:03:47] [INFO ] Deduced a trap composed of 169 places in 151 ms of which 2 ms to minimize.
[2024-06-01 14:03:52] [INFO ] Deduced a trap composed of 366 places in 234 ms of which 3 ms to minimize.
[2024-06-01 14:03:53] [INFO ] Deduced a trap composed of 366 places in 329 ms of which 3 ms to minimize.
[2024-06-01 14:03:55] [INFO ] Deduced a trap composed of 15 places in 177 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 592/2124 variables, and 63 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 23/23 constraints]
After SMT, in 45432ms problems are : Problem set: 0 solved, 1548 unsolved
Search for dead transitions found 0 dead transitions in 45456ms
[2024-06-01 14:04:04] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-06-01 14:04:04] [INFO ] Invariant cache hit.
[2024-06-01 14:04:04] [INFO ] Implicit Places using invariants in 368 ms returned []
[2024-06-01 14:04:04] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-06-01 14:04:04] [INFO ] Invariant cache hit.
[2024-06-01 14:04:05] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:04:12] [INFO ] Implicit Places using invariants and state equation in 7985 ms returned []
Implicit Place search using SMT with State Equation took 8374 ms to find 0 implicit places.
Running 1548 sub problems to find dead transitions.
[2024-06-01 14:04:12] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-06-01 14:04:12] [INFO ] Invariant cache hit.
[2024-06-01 14:04:12] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-06-01 14:04:28] [INFO ] Deduced a trap composed of 82 places in 53 ms of which 0 ms to minimize.
[2024-06-01 14:04:28] [INFO ] Deduced a trap composed of 82 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:04:28] [INFO ] Deduced a trap composed of 82 places in 60 ms of which 1 ms to minimize.
[2024-06-01 14:04:28] [INFO ] Deduced a trap composed of 82 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:04:28] [INFO ] Deduced a trap composed of 82 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:04:29] [INFO ] Deduced a trap composed of 360 places in 272 ms of which 4 ms to minimize.
[2024-06-01 14:04:29] [INFO ] Deduced a trap composed of 359 places in 250 ms of which 3 ms to minimize.
[2024-06-01 14:04:29] [INFO ] Deduced a trap composed of 263 places in 240 ms of which 2 ms to minimize.
[2024-06-01 14:04:30] [INFO ] Deduced a trap composed of 82 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:04:30] [INFO ] Deduced a trap composed of 288 places in 248 ms of which 3 ms to minimize.
[2024-06-01 14:04:31] [INFO ] Deduced a trap composed of 362 places in 301 ms of which 3 ms to minimize.
[2024-06-01 14:04:32] [INFO ] Deduced a trap composed of 362 places in 365 ms of which 3 ms to minimize.
[2024-06-01 14:04:32] [INFO ] Deduced a trap composed of 355 places in 288 ms of which 3 ms to minimize.
[2024-06-01 14:04:32] [INFO ] Deduced a trap composed of 350 places in 272 ms of which 3 ms to minimize.
[2024-06-01 14:04:33] [INFO ] Deduced a trap composed of 342 places in 267 ms of which 3 ms to minimize.
[2024-06-01 14:04:33] [INFO ] Deduced a trap composed of 330 places in 282 ms of which 3 ms to minimize.
[2024-06-01 14:04:33] [INFO ] Deduced a trap composed of 339 places in 279 ms of which 2 ms to minimize.
[2024-06-01 14:04:33] [INFO ] Deduced a trap composed of 305 places in 334 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2124 variables, and 58 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-06-01 14:04:50] [INFO ] Deduced a trap composed of 334 places in 333 ms of which 4 ms to minimize.
[2024-06-01 14:04:51] [INFO ] Deduced a trap composed of 169 places in 222 ms of which 3 ms to minimize.
[2024-06-01 14:04:57] [INFO ] Deduced a trap composed of 366 places in 245 ms of which 3 ms to minimize.
[2024-06-01 14:04:57] [INFO ] Deduced a trap composed of 366 places in 347 ms of which 4 ms to minimize.
[2024-06-01 14:04:59] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 2 ms to minimize.
[2024-06-01 14:05:08] [INFO ] Deduced a trap composed of 414 places in 263 ms of which 4 ms to minimize.
[2024-06-01 14:05:09] [INFO ] Deduced a trap composed of 65 places in 267 ms of which 3 ms to minimize.
[2024-06-01 14:05:09] [INFO ] Deduced a trap composed of 42 places in 281 ms of which 3 ms to minimize.
[2024-06-01 14:05:13] [INFO ] Deduced a trap composed of 358 places in 304 ms of which 4 ms to minimize.
[2024-06-01 14:05:13] [INFO ] Deduced a trap composed of 313 places in 262 ms of which 3 ms to minimize.
[2024-06-01 14:05:13] [INFO ] Deduced a trap composed of 291 places in 226 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 11/69 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 592/2124 variables, and 69 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 29/29 constraints]
After SMT, in 65680ms problems are : Problem set: 0 solved, 1548 unsolved
Search for dead transitions found 0 dead transitions in 65698ms
Finished structural reductions in LTL mode , in 1 iterations and 119553 ms. Remains : 596/596 places, 1552/1552 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 71 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 505 steps (0 resets) in 6 ms. (72 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 76 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 14:05:18] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-06-01 14:05:18] [INFO ] Invariant cache hit.
[2024-06-01 14:05:19] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2024-06-01 14:05:19] [INFO ] [Real]Absence check using 16 positive and 28 generalized place invariants in 85 ms returned sat
[2024-06-01 14:05:20] [INFO ] [Real]Absence check using state equation in 1092 ms returned sat
[2024-06-01 14:05:20] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:05:21] [INFO ] [Nat]Absence check using 16 positive place invariants in 6 ms returned sat
[2024-06-01 14:05:21] [INFO ] [Nat]Absence check using 16 positive and 28 generalized place invariants in 58 ms returned sat
[2024-06-01 14:05:23] [INFO ] [Nat]Absence check using state equation in 1671 ms returned sat
[2024-06-01 14:05:23] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:05:23] [INFO ] [Nat]Added 120 Read/Feed constraints in 593 ms returned sat
[2024-06-01 14:05:23] [INFO ] Deduced a trap composed of 82 places in 80 ms of which 1 ms to minimize.
[2024-06-01 14:05:23] [INFO ] Deduced a trap composed of 82 places in 94 ms of which 1 ms to minimize.
[2024-06-01 14:05:24] [INFO ] Deduced a trap composed of 82 places in 119 ms of which 1 ms to minimize.
[2024-06-01 14:05:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 986 ms
[2024-06-01 14:05:24] [INFO ] Computed and/alt/rep : 1098/4213/1080 causal constraints (skipped 444 transitions) in 78 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:587)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:619)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:262)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:958)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 14:05:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 727 reset in 436 ms.
Product exploration explored 100000 steps with 716 reset in 411 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 12 out of 596 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 596/596 places, 1552/1552 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 596 transition count 1552
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 36 Pre rules applied. Total rules applied 30 place count 596 transition count 1600
Deduced a syphon composed of 66 places in 1 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 66 place count 596 transition count 1600
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 78 place count 584 transition count 1588
Deduced a syphon composed of 54 places in 1 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 90 place count 584 transition count 1588
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 150 places in 2 ms
Iterating global reduction 1 with 96 rules applied. Total rules applied 186 place count 584 transition count 1588
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 210 place count 560 transition count 1564
Deduced a syphon composed of 132 places in 2 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 234 place count 560 transition count 1564
Deduced a syphon composed of 132 places in 2 ms
Applied a total of 234 rules in 337 ms. Remains 560 /596 variables (removed 36) and now considering 1564/1552 (removed -12) transitions.
Running 1560 sub problems to find dead transitions.
[2024-06-01 14:05:37] [INFO ] Flow matrix only has 1540 transitions (discarded 24 similar events)
// Phase 1: matrix 1540 rows 560 cols
[2024-06-01 14:05:37] [INFO ] Computed 44 invariants in 52 ms
[2024-06-01 14:05:37] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/556 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/556 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
[2024-06-01 14:05:54] [INFO ] Deduced a trap composed of 54 places in 374 ms of which 3 ms to minimize.
[2024-06-01 14:05:54] [INFO ] Deduced a trap composed of 54 places in 253 ms of which 3 ms to minimize.
[2024-06-01 14:05:55] [INFO ] Deduced a trap composed of 54 places in 266 ms of which 3 ms to minimize.
[2024-06-01 14:05:55] [INFO ] Deduced a trap composed of 54 places in 263 ms of which 3 ms to minimize.
[2024-06-01 14:05:55] [INFO ] Deduced a trap composed of 218 places in 244 ms of which 3 ms to minimize.
[2024-06-01 14:05:55] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:05:56] [INFO ] Deduced a trap composed of 232 places in 520 ms of which 31 ms to minimize.
[2024-06-01 14:05:57] [INFO ] Deduced a trap composed of 173 places in 278 ms of which 3 ms to minimize.
[2024-06-01 14:05:57] [INFO ] Deduced a trap composed of 158 places in 273 ms of which 3 ms to minimize.
[2024-06-01 14:05:58] [INFO ] Deduced a trap composed of 54 places in 51 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 556/2100 variables, and 50 constraints, problems are : Problem set: 0 solved, 1560 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/17 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/560 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1560/1560 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1560 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/556 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/556 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1092 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1095 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1304 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1312 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1320 is UNSAT
Problem TDEAD1324 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1340 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1356 is UNSAT
Problem TDEAD1360 is UNSAT
Problem TDEAD1364 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1372 is UNSAT
Problem TDEAD1376 is UNSAT
Problem TDEAD1380 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1388 is UNSAT
Problem TDEAD1392 is UNSAT
Problem TDEAD1547 is UNSAT
Problem TDEAD1549 is UNSAT
Problem TDEAD1551 is UNSAT
Problem TDEAD1553 is UNSAT
Problem TDEAD1555 is UNSAT
Problem TDEAD1557 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/556 variables, 10/50 constraints. Problems are: Problem set: 168 solved, 1392 unsolved
[2024-06-01 14:06:04] [INFO ] Deduced a trap composed of 40 places in 346 ms of which 4 ms to minimize.
[2024-06-01 14:06:05] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 2 ms to minimize.
[2024-06-01 14:06:15] [INFO ] Deduced a trap composed of 186 places in 409 ms of which 5 ms to minimize.
[2024-06-01 14:06:17] [INFO ] Deduced a trap composed of 35 places in 164 ms of which 1 ms to minimize.
[2024-06-01 14:06:18] [INFO ] Deduced a trap composed of 181 places in 285 ms of which 3 ms to minimize.
[2024-06-01 14:06:18] [INFO ] Deduced a trap composed of 144 places in 375 ms of which 4 ms to minimize.
[2024-06-01 14:06:19] [INFO ] Deduced a trap composed of 149 places in 269 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/556 variables, 7/57 constraints. Problems are: Problem set: 168 solved, 1392 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 556/2100 variables, and 57 constraints, problems are : Problem set: 168 solved, 1392 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/17 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/560 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 0/1560 constraints, Known Traps: 17/17 constraints]
After SMT, in 45137ms problems are : Problem set: 168 solved, 1392 unsolved
Search for dead transitions found 168 dead transitions in 45168ms
Found 168 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 168 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 168 transitions.
[2024-06-01 14:06:22] [INFO ] Redundant transitions in 89 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 560/596 places, 1396/1552 transitions.
Graph (complete) has 3004 edges and 560 vertex of which 440 are kept as prefixes of interest. Removing 120 places using SCC suffix rule.5 ms
Discarding 120 places :
Also discarding 0 output transitions
Deduced a syphon composed of 12 places in 2 ms
Applied a total of 1 rules in 36 ms. Remains 440 /560 variables (removed 120) and now considering 1396/1396 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 440/596 places, 1396/1552 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 45656 ms. Remains : 440/596 places, 1396/1552 transitions.
Support contains 12 out of 596 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 1552/1552 transitions.
Applied a total of 0 rules in 15 ms. Remains 596 /596 variables (removed 0) and now considering 1552/1552 (removed 0) transitions.
Running 1548 sub problems to find dead transitions.
[2024-06-01 14:06:22] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
// Phase 1: matrix 1528 rows 596 cols
[2024-06-01 14:06:22] [INFO ] Computed 44 invariants in 28 ms
[2024-06-01 14:06:22] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-06-01 14:06:38] [INFO ] Deduced a trap composed of 82 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:06:38] [INFO ] Deduced a trap composed of 82 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:06:38] [INFO ] Deduced a trap composed of 82 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:06:38] [INFO ] Deduced a trap composed of 82 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:06:38] [INFO ] Deduced a trap composed of 82 places in 54 ms of which 0 ms to minimize.
[2024-06-01 14:06:39] [INFO ] Deduced a trap composed of 398 places in 306 ms of which 3 ms to minimize.
[2024-06-01 14:06:39] [INFO ] Deduced a trap composed of 359 places in 278 ms of which 3 ms to minimize.
[2024-06-01 14:06:39] [INFO ] Deduced a trap composed of 348 places in 280 ms of which 4 ms to minimize.
[2024-06-01 14:06:40] [INFO ] Deduced a trap composed of 139 places in 342 ms of which 4 ms to minimize.
[2024-06-01 14:06:40] [INFO ] Deduced a trap composed of 82 places in 259 ms of which 3 ms to minimize.
[2024-06-01 14:06:41] [INFO ] Deduced a trap composed of 160 places in 334 ms of which 5 ms to minimize.
[2024-06-01 14:06:41] [INFO ] Deduced a trap composed of 304 places in 396 ms of which 4 ms to minimize.
[2024-06-01 14:06:42] [INFO ] Deduced a trap composed of 328 places in 331 ms of which 4 ms to minimize.
[2024-06-01 14:06:43] [INFO ] Deduced a trap composed of 429 places in 280 ms of which 3 ms to minimize.
[2024-06-01 14:06:43] [INFO ] Deduced a trap composed of 366 places in 274 ms of which 3 ms to minimize.
[2024-06-01 14:06:44] [INFO ] Deduced a trap composed of 375 places in 377 ms of which 3 ms to minimize.
[2024-06-01 14:06:44] [INFO ] Deduced a trap composed of 355 places in 306 ms of which 3 ms to minimize.
[2024-06-01 14:06:44] [INFO ] Deduced a trap composed of 371 places in 286 ms of which 3 ms to minimize.
[2024-06-01 14:06:45] [INFO ] Deduced a trap composed of 340 places in 281 ms of which 3 ms to minimize.
[2024-06-01 14:06:45] [INFO ] Deduced a trap composed of 358 places in 270 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2124 variables, and 60 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-06-01 14:06:50] [INFO ] Deduced a trap composed of 41 places in 183 ms of which 1 ms to minimize.
[2024-06-01 14:06:55] [INFO ] Deduced a trap composed of 382 places in 238 ms of which 3 ms to minimize.
[2024-06-01 14:06:55] [INFO ] Deduced a trap composed of 362 places in 232 ms of which 3 ms to minimize.
[2024-06-01 14:06:57] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 3 ms to minimize.
[2024-06-01 14:07:05] [INFO ] Deduced a trap composed of 282 places in 293 ms of which 3 ms to minimize.
[2024-06-01 14:07:06] [INFO ] Deduced a trap composed of 42 places in 270 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 592/2124 variables, and 66 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 26/26 constraints]
After SMT, in 44861ms problems are : Problem set: 0 solved, 1548 unsolved
Search for dead transitions found 0 dead transitions in 44877ms
[2024-06-01 14:07:07] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-06-01 14:07:07] [INFO ] Invariant cache hit.
[2024-06-01 14:07:07] [INFO ] Implicit Places using invariants in 361 ms returned []
[2024-06-01 14:07:07] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-06-01 14:07:07] [INFO ] Invariant cache hit.
[2024-06-01 14:07:08] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:07:16] [INFO ] Implicit Places using invariants and state equation in 8245 ms returned []
Implicit Place search using SMT with State Equation took 8621 ms to find 0 implicit places.
Running 1548 sub problems to find dead transitions.
[2024-06-01 14:07:16] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-06-01 14:07:16] [INFO ] Invariant cache hit.
[2024-06-01 14:07:16] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-06-01 14:07:31] [INFO ] Deduced a trap composed of 82 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:07:32] [INFO ] Deduced a trap composed of 82 places in 61 ms of which 0 ms to minimize.
[2024-06-01 14:07:32] [INFO ] Deduced a trap composed of 82 places in 42 ms of which 2 ms to minimize.
[2024-06-01 14:07:32] [INFO ] Deduced a trap composed of 82 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:07:32] [INFO ] Deduced a trap composed of 82 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:07:32] [INFO ] Deduced a trap composed of 360 places in 259 ms of which 3 ms to minimize.
[2024-06-01 14:07:32] [INFO ] Deduced a trap composed of 359 places in 252 ms of which 12 ms to minimize.
[2024-06-01 14:07:33] [INFO ] Deduced a trap composed of 263 places in 213 ms of which 3 ms to minimize.
[2024-06-01 14:07:33] [INFO ] Deduced a trap composed of 82 places in 64 ms of which 1 ms to minimize.
[2024-06-01 14:07:33] [INFO ] Deduced a trap composed of 288 places in 240 ms of which 3 ms to minimize.
[2024-06-01 14:07:35] [INFO ] Deduced a trap composed of 362 places in 295 ms of which 3 ms to minimize.
[2024-06-01 14:07:35] [INFO ] Deduced a trap composed of 362 places in 291 ms of which 4 ms to minimize.
[2024-06-01 14:07:35] [INFO ] Deduced a trap composed of 355 places in 305 ms of which 3 ms to minimize.
[2024-06-01 14:07:36] [INFO ] Deduced a trap composed of 350 places in 308 ms of which 4 ms to minimize.
[2024-06-01 14:07:36] [INFO ] Deduced a trap composed of 342 places in 323 ms of which 3 ms to minimize.
[2024-06-01 14:07:36] [INFO ] Deduced a trap composed of 330 places in 302 ms of which 3 ms to minimize.
[2024-06-01 14:07:37] [INFO ] Deduced a trap composed of 339 places in 299 ms of which 4 ms to minimize.
[2024-06-01 14:07:37] [INFO ] Deduced a trap composed of 305 places in 282 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2124 variables, and 58 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-06-01 14:07:52] [INFO ] Deduced a trap composed of 334 places in 259 ms of which 4 ms to minimize.
[2024-06-01 14:07:53] [INFO ] Deduced a trap composed of 169 places in 163 ms of which 3 ms to minimize.
[2024-06-01 14:07:59] [INFO ] Deduced a trap composed of 366 places in 267 ms of which 3 ms to minimize.
[2024-06-01 14:07:59] [INFO ] Deduced a trap composed of 366 places in 257 ms of which 3 ms to minimize.
[2024-06-01 14:08:01] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 2 ms to minimize.
[2024-06-01 14:08:10] [INFO ] Deduced a trap composed of 414 places in 277 ms of which 3 ms to minimize.
[2024-06-01 14:08:11] [INFO ] Deduced a trap composed of 65 places in 302 ms of which 3 ms to minimize.
[2024-06-01 14:08:11] [INFO ] Deduced a trap composed of 42 places in 274 ms of which 4 ms to minimize.
[2024-06-01 14:08:14] [INFO ] Deduced a trap composed of 358 places in 234 ms of which 6 ms to minimize.
[2024-06-01 14:08:15] [INFO ] Deduced a trap composed of 313 places in 251 ms of which 3 ms to minimize.
[2024-06-01 14:08:15] [INFO ] Deduced a trap composed of 291 places in 214 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 11/69 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
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 592/2124 variables, and 69 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 29/29 constraints]
After SMT, in 64938ms problems are : Problem set: 0 solved, 1548 unsolved
Search for dead transitions found 0 dead transitions in 64951ms
Finished structural reductions in LTL mode , in 1 iterations and 118470 ms. Remains : 596/596 places, 1552/1552 transitions.
Treatment of property PolyORBLF-COL-S04J06T06-LTLCardinality-03 finished in 440856 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(p0)||G(F(p1))))'
Support contains 48 out of 600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 600/600 places, 1552/1552 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 596 transition count 1510
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 554 transition count 1510
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 84 place count 554 transition count 1438
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 228 place count 482 transition count 1438
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 2 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 336 place count 428 transition count 1384
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 342 place count 422 transition count 1378
Iterating global reduction 2 with 6 rules applied. Total rules applied 348 place count 422 transition count 1378
Applied a total of 348 rules in 97 ms. Remains 422 /600 variables (removed 178) and now considering 1378/1552 (removed 174) transitions.
Running 1374 sub problems to find dead transitions.
[2024-06-01 14:08:21] [INFO ] Flow matrix only has 1354 transitions (discarded 24 similar events)
// Phase 1: matrix 1354 rows 422 cols
[2024-06-01 14:08:21] [INFO ] Computed 44 invariants in 31 ms
[2024-06-01 14:08:21] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
[2024-06-01 14:08:34] [INFO ] Deduced a trap composed of 53 places in 93 ms of which 1 ms to minimize.
[2024-06-01 14:08:34] [INFO ] Deduced a trap composed of 54 places in 68 ms of which 1 ms to minimize.
[2024-06-01 14:08:34] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 0 ms to minimize.
[2024-06-01 14:08:34] [INFO ] Deduced a trap composed of 53 places in 44 ms of which 0 ms to minimize.
[2024-06-01 14:08:34] [INFO ] Deduced a trap composed of 53 places in 41 ms of which 1 ms to minimize.
[2024-06-01 14:08:34] [INFO ] Deduced a trap composed of 201 places in 301 ms of which 3 ms to minimize.
[2024-06-01 14:08:35] [INFO ] Deduced a trap composed of 171 places in 336 ms of which 2 ms to minimize.
[2024-06-01 14:08:35] [INFO ] Deduced a trap composed of 186 places in 287 ms of which 2 ms to minimize.
[2024-06-01 14:08:36] [INFO ] Deduced a trap composed of 53 places in 66 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/1776 variables, and 49 constraints, problems are : Problem set: 0 solved, 1374 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/422 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1374/1374 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1374 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
[2024-06-01 14:08:49] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 1 ms to minimize.
[2024-06-01 14:08:51] [INFO ] Deduced a trap composed of 222 places in 192 ms of which 2 ms to minimize.
[2024-06-01 14:08:52] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 2 ms to minimize.
[2024-06-01 14:09:00] [INFO ] Deduced a trap composed of 132 places in 275 ms of which 2 ms to minimize.
[2024-06-01 14:09:01] [INFO ] Deduced a trap composed of 142 places in 213 ms of which 3 ms to minimize.
[2024-06-01 14:09:02] [INFO ] Deduced a trap composed of 173 places in 212 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/1776 variables, and 55 constraints, problems are : Problem set: 0 solved, 1374 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/422 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1374 constraints, Known Traps: 15/15 constraints]
After SMT, in 45266ms problems are : Problem set: 0 solved, 1374 unsolved
Search for dead transitions found 0 dead transitions in 45291ms
[2024-06-01 14:09:06] [INFO ] Flow matrix only has 1354 transitions (discarded 24 similar events)
[2024-06-01 14:09:06] [INFO ] Invariant cache hit.
[2024-06-01 14:09:07] [INFO ] Implicit Places using invariants in 614 ms returned []
[2024-06-01 14:09:07] [INFO ] Flow matrix only has 1354 transitions (discarded 24 similar events)
[2024-06-01 14:09:07] [INFO ] Invariant cache hit.
[2024-06-01 14:09:08] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:09:14] [INFO ] Implicit Places using invariants and state equation in 6882 ms returned []
Implicit Place search using SMT with State Equation took 7499 ms to find 0 implicit places.
[2024-06-01 14:09:14] [INFO ] Redundant transitions in 73 ms returned []
Running 1374 sub problems to find dead transitions.
[2024-06-01 14:09:14] [INFO ] Flow matrix only has 1354 transitions (discarded 24 similar events)
[2024-06-01 14:09:14] [INFO ] Invariant cache hit.
[2024-06-01 14:09:14] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
[2024-06-01 14:09:27] [INFO ] Deduced a trap composed of 53 places in 96 ms of which 1 ms to minimize.
[2024-06-01 14:09:27] [INFO ] Deduced a trap composed of 54 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:09:27] [INFO ] Deduced a trap composed of 53 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:09:27] [INFO ] Deduced a trap composed of 53 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:09:27] [INFO ] Deduced a trap composed of 53 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:09:27] [INFO ] Deduced a trap composed of 184 places in 239 ms of which 2 ms to minimize.
[2024-06-01 14:09:28] [INFO ] Deduced a trap composed of 171 places in 245 ms of which 3 ms to minimize.
[2024-06-01 14:09:28] [INFO ] Deduced a trap composed of 173 places in 377 ms of which 2 ms to minimize.
[2024-06-01 14:09:29] [INFO ] Deduced a trap composed of 53 places in 78 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
[2024-06-01 14:09:41] [INFO ] Deduced a trap composed of 45 places in 154 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/1776 variables, and 50 constraints, problems are : Problem set: 0 solved, 1374 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/422 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1374/1374 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1374 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 10/50 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
[2024-06-01 14:09:54] [INFO ] Deduced a trap composed of 222 places in 209 ms of which 3 ms to minimize.
[2024-06-01 14:09:55] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 2 ms to minimize.
[2024-06-01 14:10:03] [INFO ] Deduced a trap composed of 132 places in 194 ms of which 2 ms to minimize.
[2024-06-01 14:10:04] [INFO ] Deduced a trap composed of 149 places in 196 ms of which 2 ms to minimize.
[2024-06-01 14:10:05] [INFO ] Deduced a trap composed of 133 places in 249 ms of which 2 ms to minimize.
[2024-06-01 14:10:05] [INFO ] Deduced a trap composed of 126 places in 206 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/1776 variables, and 56 constraints, problems are : Problem set: 0 solved, 1374 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/422 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1374 constraints, Known Traps: 16/16 constraints]
After SMT, in 65393ms problems are : Problem set: 0 solved, 1374 unsolved
Search for dead transitions found 0 dead transitions in 65421ms
Starting structural reductions in SI_LTL mode, iteration 1 : 422/600 places, 1378/1552 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 118422 ms. Remains : 422/600 places, 1378/1552 transitions.
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : PolyORBLF-COL-S04J06T06-LTLCardinality-04
Stuttering criterion allowed to conclude after 6611 steps with 2 reset in 22 ms.
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S04J06T06-LTLCardinality-04 finished in 118601 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 12 out of 600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 600/600 places, 1552/1552 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 596 transition count 1522
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 566 transition count 1522
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 78 Pre rules applied. Total rules applied 60 place count 566 transition count 1444
Deduced a syphon composed of 78 places in 20 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 216 place count 488 transition count 1444
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 324 place count 434 transition count 1390
Applied a total of 324 rules in 70 ms. Remains 434 /600 variables (removed 166) and now considering 1390/1552 (removed 162) transitions.
Running 1386 sub problems to find dead transitions.
[2024-06-01 14:10:20] [INFO ] Flow matrix only has 1366 transitions (discarded 24 similar events)
// Phase 1: matrix 1366 rows 434 cols
[2024-06-01 14:10:20] [INFO ] Computed 44 invariants in 18 ms
[2024-06-01 14:10:20] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
[2024-06-01 14:10:33] [INFO ] Deduced a trap composed of 55 places in 60 ms of which 1 ms to minimize.
[2024-06-01 14:10:33] [INFO ] Deduced a trap composed of 55 places in 44 ms of which 0 ms to minimize.
[2024-06-01 14:10:33] [INFO ] Deduced a trap composed of 55 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:10:33] [INFO ] Deduced a trap composed of 55 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:10:33] [INFO ] Deduced a trap composed of 55 places in 53 ms of which 0 ms to minimize.
[2024-06-01 14:10:33] [INFO ] Deduced a trap composed of 201 places in 242 ms of which 2 ms to minimize.
[2024-06-01 14:10:34] [INFO ] Deduced a trap composed of 187 places in 197 ms of which 2 ms to minimize.
[2024-06-01 14:10:34] [INFO ] Deduced a trap composed of 201 places in 288 ms of which 3 ms to minimize.
[2024-06-01 14:10:34] [INFO ] Deduced a trap composed of 194 places in 232 ms of which 2 ms to minimize.
[2024-06-01 14:10:34] [INFO ] Deduced a trap composed of 15 places in 225 ms of which 2 ms to minimize.
[2024-06-01 14:10:35] [INFO ] Deduced a trap composed of 221 places in 225 ms of which 2 ms to minimize.
[2024-06-01 14:10:35] [INFO ] Deduced a trap composed of 218 places in 244 ms of which 3 ms to minimize.
[2024-06-01 14:10:35] [INFO ] Deduced a trap composed of 229 places in 246 ms of which 2 ms to minimize.
[2024-06-01 14:10:36] [INFO ] Deduced a trap composed of 240 places in 277 ms of which 2 ms to minimize.
[2024-06-01 14:10:36] [INFO ] Deduced a trap composed of 207 places in 342 ms of which 3 ms to minimize.
[2024-06-01 14:10:36] [INFO ] Deduced a trap composed of 209 places in 327 ms of which 3 ms to minimize.
[2024-06-01 14:10:36] [INFO ] Deduced a trap composed of 190 places in 244 ms of which 2 ms to minimize.
[2024-06-01 14:10:37] [INFO ] Deduced a trap composed of 55 places in 44 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 430/1800 variables, and 58 constraints, problems are : Problem set: 0 solved, 1386 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/29 constraints, State Equation: 0/434 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1386/1386 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1386 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
[2024-06-01 14:10:50] [INFO ] Deduced a trap composed of 228 places in 189 ms of which 2 ms to minimize.
[2024-06-01 14:11:04] [INFO ] Deduced a trap composed of 138 places in 338 ms of which 2 ms to minimize.
[2024-06-01 14:11:04] [INFO ] Deduced a trap composed of 67 places in 173 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/1800 variables, and 61 constraints, problems are : Problem set: 0 solved, 1386 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/29 constraints, State Equation: 0/434 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1386 constraints, Known Traps: 21/21 constraints]
After SMT, in 45307ms problems are : Problem set: 0 solved, 1386 unsolved
Search for dead transitions found 0 dead transitions in 45321ms
[2024-06-01 14:11:05] [INFO ] Flow matrix only has 1366 transitions (discarded 24 similar events)
[2024-06-01 14:11:05] [INFO ] Invariant cache hit.
[2024-06-01 14:11:05] [INFO ] Implicit Places using invariants in 488 ms returned []
[2024-06-01 14:11:05] [INFO ] Flow matrix only has 1366 transitions (discarded 24 similar events)
[2024-06-01 14:11:05] [INFO ] Invariant cache hit.
[2024-06-01 14:11:06] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:11:12] [INFO ] Implicit Places using invariants and state equation in 6623 ms returned []
Implicit Place search using SMT with State Equation took 7144 ms to find 0 implicit places.
[2024-06-01 14:11:12] [INFO ] Redundant transitions in 18 ms returned []
Running 1386 sub problems to find dead transitions.
[2024-06-01 14:11:12] [INFO ] Flow matrix only has 1366 transitions (discarded 24 similar events)
[2024-06-01 14:11:12] [INFO ] Invariant cache hit.
[2024-06-01 14:11:12] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
[2024-06-01 14:11:27] [INFO ] Deduced a trap composed of 55 places in 68 ms of which 2 ms to minimize.
[2024-06-01 14:11:27] [INFO ] Deduced a trap composed of 55 places in 77 ms of which 1 ms to minimize.
[2024-06-01 14:11:27] [INFO ] Deduced a trap composed of 55 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:11:27] [INFO ] Deduced a trap composed of 55 places in 49 ms of which 0 ms to minimize.
[2024-06-01 14:11:27] [INFO ] Deduced a trap composed of 55 places in 59 ms of which 0 ms to minimize.
[2024-06-01 14:11:27] [INFO ] Deduced a trap composed of 229 places in 237 ms of which 2 ms to minimize.
[2024-06-01 14:11:28] [INFO ] Deduced a trap composed of 199 places in 220 ms of which 2 ms to minimize.
[2024-06-01 14:11:28] [INFO ] Deduced a trap composed of 218 places in 265 ms of which 2 ms to minimize.
[2024-06-01 14:11:28] [INFO ] Deduced a trap composed of 207 places in 243 ms of which 2 ms to minimize.
[2024-06-01 14:11:28] [INFO ] Deduced a trap composed of 206 places in 277 ms of which 2 ms to minimize.
[2024-06-01 14:11:29] [INFO ] Deduced a trap composed of 194 places in 232 ms of which 2 ms to minimize.
[2024-06-01 14:11:29] [INFO ] Deduced a trap composed of 15 places in 235 ms of which 3 ms to minimize.
[2024-06-01 14:11:29] [INFO ] Deduced a trap composed of 202 places in 230 ms of which 2 ms to minimize.
[2024-06-01 14:11:30] [INFO ] Deduced a trap composed of 184 places in 281 ms of which 3 ms to minimize.
[2024-06-01 14:11:30] [INFO ] Deduced a trap composed of 192 places in 279 ms of which 2 ms to minimize.
[2024-06-01 14:11:30] [INFO ] Deduced a trap composed of 192 places in 257 ms of which 3 ms to minimize.
[2024-06-01 14:11:31] [INFO ] Deduced a trap composed of 55 places in 52 ms of which 0 ms to minimize.
[2024-06-01 14:11:32] [INFO ] Deduced a trap composed of 228 places in 185 ms of which 2 ms to minimize.
[2024-06-01 14:11:43] [INFO ] Deduced a trap composed of 174 places in 254 ms of which 3 ms to minimize.
[2024-06-01 14:11:43] [INFO ] Deduced a trap composed of 163 places in 306 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 430/1800 variables, and 60 constraints, problems are : Problem set: 0 solved, 1386 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/29 constraints, State Equation: 0/434 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1386/1386 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1386 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
[2024-06-01 14:11:49] [INFO ] Deduced a trap composed of 176 places in 308 ms of which 3 ms to minimize.
[2024-06-01 14:12:05] [INFO ] Deduced a trap composed of 238 places in 235 ms of which 3 ms to minimize.
[2024-06-01 14:12:05] [INFO ] Deduced a trap composed of 138 places in 281 ms of which 3 ms to minimize.
[2024-06-01 14:12:06] [INFO ] Deduced a trap composed of 144 places in 254 ms of which 2 ms to minimize.
[2024-06-01 14:12:06] [INFO ] Deduced a trap composed of 212 places in 223 ms of which 2 ms to minimize.
[2024-06-01 14:12:06] [INFO ] Deduced a trap composed of 188 places in 216 ms of which 2 ms to minimize.
[2024-06-01 14:12:06] [INFO ] Deduced a trap composed of 232 places in 293 ms of which 3 ms to minimize.
[2024-06-01 14:12:07] [INFO ] Deduced a trap composed of 63 places in 248 ms of which 2 ms to minimize.
[2024-06-01 14:12:08] [INFO ] Deduced a trap composed of 60 places in 212 ms of which 3 ms to minimize.
[2024-06-01 14:12:08] [INFO ] Deduced a trap composed of 64 places in 194 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/430 variables, 10/70 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/1800 variables, and 70 constraints, problems are : Problem set: 0 solved, 1386 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/29 constraints, State Equation: 0/434 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1386 constraints, Known Traps: 30/30 constraints]
After SMT, in 65245ms problems are : Problem set: 0 solved, 1386 unsolved
Search for dead transitions found 0 dead transitions in 65270ms
Starting structural reductions in SI_LTL mode, iteration 1 : 434/600 places, 1390/1552 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 117855 ms. Remains : 434/600 places, 1390/1552 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J06T06-LTLCardinality-07
Product exploration explored 100000 steps with 8 reset in 464 ms.
Product exploration explored 100000 steps with 11 reset in 495 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 136 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 320 ms. (124 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (8 resets) in 169 ms. (235 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 277627 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :0 out of 1
Probabilistic random walk after 277627 steps, saw 185089 distinct states, run finished after 3005 ms. (steps per millisecond=92 ) properties seen :0
[2024-06-01 14:12:22] [INFO ] Flow matrix only has 1366 transitions (discarded 24 similar events)
[2024-06-01 14:12:22] [INFO ] Invariant cache hit.
[2024-06-01 14:12:22] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 306/318 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/318 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 33/351 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/351 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 431/1800 variables, and 42 constraints, problems are : Problem set: 1 solved, 0 unsolved in 90 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/434 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 107ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [p0, (X p0), (X (X p0)), (G p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 14 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S04J06T06-LTLCardinality-07 finished in 122453 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 2 out of 600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 600/600 places, 1552/1552 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 596 transition count 1510
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 554 transition count 1510
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 84 place count 554 transition count 1438
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 228 place count 482 transition count 1438
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 348 place count 422 transition count 1378
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 354 place count 416 transition count 1372
Iterating global reduction 2 with 6 rules applied. Total rules applied 360 place count 416 transition count 1372
Applied a total of 360 rules in 73 ms. Remains 416 /600 variables (removed 184) and now considering 1372/1552 (removed 180) transitions.
Running 1368 sub problems to find dead transitions.
[2024-06-01 14:12:22] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
// Phase 1: matrix 1348 rows 416 cols
[2024-06-01 14:12:22] [INFO ] Computed 44 invariants in 38 ms
[2024-06-01 14:12:22] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/412 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/412 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-06-01 14:12:35] [INFO ] Deduced a trap composed of 52 places in 112 ms of which 2 ms to minimize.
[2024-06-01 14:12:35] [INFO ] Deduced a trap composed of 52 places in 112 ms of which 1 ms to minimize.
[2024-06-01 14:12:35] [INFO ] Deduced a trap composed of 52 places in 95 ms of which 1 ms to minimize.
[2024-06-01 14:12:35] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 0 ms to minimize.
[2024-06-01 14:12:35] [INFO ] Deduced a trap composed of 52 places in 41 ms of which 0 ms to minimize.
[2024-06-01 14:12:35] [INFO ] Deduced a trap composed of 193 places in 236 ms of which 2 ms to minimize.
[2024-06-01 14:12:36] [INFO ] Deduced a trap composed of 173 places in 231 ms of which 2 ms to minimize.
[2024-06-01 14:12:36] [INFO ] Deduced a trap composed of 52 places in 44 ms of which 0 ms to minimize.
[2024-06-01 14:12:38] [INFO ] Deduced a trap composed of 216 places in 210 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 412/1764 variables, and 49 constraints, problems are : Problem set: 0 solved, 1368 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/416 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1368/1368 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/412 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/412 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-06-01 14:12:49] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 1 ms to minimize.
[2024-06-01 14:12:49] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2024-06-01 14:12:51] [INFO ] Deduced a trap composed of 47 places in 139 ms of which 1 ms to minimize.
[2024-06-01 14:13:03] [INFO ] Deduced a trap composed of 132 places in 304 ms of which 3 ms to minimize.
[2024-06-01 14:13:04] [INFO ] Deduced a trap composed of 132 places in 346 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 412/1764 variables, and 54 constraints, problems are : Problem set: 0 solved, 1368 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/416 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1368 constraints, Known Traps: 14/14 constraints]
After SMT, in 45323ms problems are : Problem set: 0 solved, 1368 unsolved
Search for dead transitions found 0 dead transitions in 45354ms
[2024-06-01 14:13:07] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
[2024-06-01 14:13:07] [INFO ] Invariant cache hit.
[2024-06-01 14:13:08] [INFO ] Implicit Places using invariants in 334 ms returned []
[2024-06-01 14:13:08] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
[2024-06-01 14:13:08] [INFO ] Invariant cache hit.
[2024-06-01 14:13:08] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:13:14] [INFO ] Implicit Places using invariants and state equation in 6106 ms returned []
Implicit Place search using SMT with State Equation took 6457 ms to find 0 implicit places.
[2024-06-01 14:13:14] [INFO ] Redundant transitions in 11 ms returned []
Running 1368 sub problems to find dead transitions.
[2024-06-01 14:13:14] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
[2024-06-01 14:13:14] [INFO ] Invariant cache hit.
[2024-06-01 14:13:14] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/412 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/412 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-06-01 14:13:27] [INFO ] Deduced a trap composed of 52 places in 92 ms of which 1 ms to minimize.
[2024-06-01 14:13:27] [INFO ] Deduced a trap composed of 52 places in 94 ms of which 1 ms to minimize.
[2024-06-01 14:13:27] [INFO ] Deduced a trap composed of 52 places in 71 ms of which 0 ms to minimize.
[2024-06-01 14:13:27] [INFO ] Deduced a trap composed of 52 places in 36 ms of which 0 ms to minimize.
[2024-06-01 14:13:27] [INFO ] Deduced a trap composed of 52 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:13:28] [INFO ] Deduced a trap composed of 205 places in 385 ms of which 2 ms to minimize.
[2024-06-01 14:13:28] [INFO ] Deduced a trap composed of 188 places in 353 ms of which 3 ms to minimize.
[2024-06-01 14:13:29] [INFO ] Deduced a trap composed of 52 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:13:39] [INFO ] Deduced a trap composed of 164 places in 233 ms of which 3 ms to minimize.
[2024-06-01 14:13:39] [INFO ] Deduced a trap composed of 15 places in 215 ms of which 3 ms to minimize.
[2024-06-01 14:13:40] [INFO ] Deduced a trap composed of 141 places in 238 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 11/51 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-06-01 14:13:43] [INFO ] Deduced a trap composed of 216 places in 223 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 412/1764 variables, and 52 constraints, problems are : Problem set: 0 solved, 1368 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/416 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1368/1368 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/412 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/412 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 12/52 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-06-01 14:13:52] [INFO ] Deduced a trap composed of 182 places in 278 ms of which 2 ms to minimize.
[2024-06-01 14:14:05] [INFO ] Deduced a trap composed of 127 places in 281 ms of which 3 ms to minimize.
[2024-06-01 14:14:05] [INFO ] Deduced a trap composed of 132 places in 276 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-06-01 14:14:16] [INFO ] Deduced a trap composed of 27 places in 164 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 412/1764 variables, and 56 constraints, problems are : Problem set: 0 solved, 1368 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/416 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1368 constraints, Known Traps: 16/16 constraints]
After SMT, in 65815ms problems are : Problem set: 0 solved, 1368 unsolved
Search for dead transitions found 0 dead transitions in 65827ms
Starting structural reductions in SI_LTL mode, iteration 1 : 416/600 places, 1372/1552 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 117739 ms. Remains : 416/600 places, 1372/1552 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J06T06-LTLCardinality-08
Stuttering criterion allowed to conclude after 1829 steps with 0 reset in 6 ms.
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S04J06T06-LTLCardinality-08 finished in 117791 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 1 out of 600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 600/600 places, 1552/1552 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 596 transition count 1516
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 560 transition count 1516
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 72 place count 560 transition count 1444
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 216 place count 488 transition count 1444
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 336 place count 428 transition count 1384
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 342 place count 422 transition count 1378
Iterating global reduction 2 with 6 rules applied. Total rules applied 348 place count 422 transition count 1378
Applied a total of 348 rules in 81 ms. Remains 422 /600 variables (removed 178) and now considering 1378/1552 (removed 174) transitions.
Running 1374 sub problems to find dead transitions.
[2024-06-01 14:14:20] [INFO ] Flow matrix only has 1354 transitions (discarded 24 similar events)
// Phase 1: matrix 1354 rows 422 cols
[2024-06-01 14:14:20] [INFO ] Computed 44 invariants in 13 ms
[2024-06-01 14:14:20] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
[2024-06-01 14:14:33] [INFO ] Deduced a trap composed of 53 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:14:33] [INFO ] Deduced a trap composed of 53 places in 52 ms of which 0 ms to minimize.
[2024-06-01 14:14:33] [INFO ] Deduced a trap composed of 53 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:14:33] [INFO ] Deduced a trap composed of 53 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:14:33] [INFO ] Deduced a trap composed of 53 places in 58 ms of which 0 ms to minimize.
[2024-06-01 14:14:34] [INFO ] Deduced a trap composed of 177 places in 241 ms of which 2 ms to minimize.
[2024-06-01 14:14:34] [INFO ] Deduced a trap composed of 173 places in 223 ms of which 2 ms to minimize.
[2024-06-01 14:14:34] [INFO ] Deduced a trap composed of 53 places in 92 ms of which 0 ms to minimize.
[2024-06-01 14:14:35] [INFO ] Deduced a trap composed of 64 places in 182 ms of which 1 ms to minimize.
[2024-06-01 14:14:36] [INFO ] Deduced a trap composed of 33 places in 156 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 9.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 1.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)
(timeout
s68 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/1776 variables, and 50 constraints, problems are : Problem set: 0 solved, 1374 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 18/20 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/422 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1374/1374 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1374 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 10/50 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
[2024-06-01 14:14:49] [INFO ] Deduced a trap composed of 222 places in 223 ms of which 2 ms to minimize.
[2024-06-01 14:14:49] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 1 ms to minimize.
[2024-06-01 14:15:00] [INFO ] Deduced a trap composed of 138 places in 188 ms of which 3 ms to minimize.
[2024-06-01 14:15:00] [INFO ] Deduced a trap composed of 138 places in 214 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 4/54 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/1776 variables, and 54 constraints, problems are : Problem set: 0 solved, 1374 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 18/20 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/422 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1374 constraints, Known Traps: 14/14 constraints]
After SMT, in 45223ms problems are : Problem set: 0 solved, 1374 unsolved
Search for dead transitions found 0 dead transitions in 45235ms
[2024-06-01 14:15:05] [INFO ] Flow matrix only has 1354 transitions (discarded 24 similar events)
[2024-06-01 14:15:05] [INFO ] Invariant cache hit.
[2024-06-01 14:15:07] [INFO ] Implicit Places using invariants in 2097 ms returned []
[2024-06-01 14:15:07] [INFO ] Flow matrix only has 1354 transitions (discarded 24 similar events)
[2024-06-01 14:15:07] [INFO ] Invariant cache hit.
[2024-06-01 14:15:08] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:15:12] [INFO ] Implicit Places using invariants and state equation in 4760 ms returned []
Implicit Place search using SMT with State Equation took 6886 ms to find 0 implicit places.
[2024-06-01 14:15:12] [INFO ] Redundant transitions in 10 ms returned []
Running 1374 sub problems to find dead transitions.
[2024-06-01 14:15:12] [INFO ] Flow matrix only has 1354 transitions (discarded 24 similar events)
[2024-06-01 14:15:12] [INFO ] Invariant cache hit.
[2024-06-01 14:15:12] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
[2024-06-01 14:15:26] [INFO ] Deduced a trap composed of 53 places in 100 ms of which 3 ms to minimize.
[2024-06-01 14:15:26] [INFO ] Deduced a trap composed of 53 places in 89 ms of which 1 ms to minimize.
[2024-06-01 14:15:26] [INFO ] Deduced a trap composed of 53 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:15:26] [INFO ] Deduced a trap composed of 53 places in 49 ms of which 0 ms to minimize.
[2024-06-01 14:15:26] [INFO ] Deduced a trap composed of 53 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:15:26] [INFO ] Deduced a trap composed of 195 places in 243 ms of which 2 ms to minimize.
[2024-06-01 14:15:27] [INFO ] Deduced a trap composed of 53 places in 34 ms of which 0 ms to minimize.
[2024-06-01 14:15:29] [INFO ] Deduced a trap composed of 222 places in 209 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 8/48 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
[2024-06-01 14:15:40] [INFO ] Deduced a trap composed of 33 places in 151 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/1776 variables, and 49 constraints, problems are : Problem set: 0 solved, 1374 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 18/20 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/422 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1374/1374 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1374 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
[2024-06-01 14:16:01] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 1 ms to minimize.
[2024-06-01 14:16:02] [INFO ] Deduced a trap composed of 138 places in 198 ms of which 2 ms to minimize.
[2024-06-01 14:16:02] [INFO ] Deduced a trap composed of 146 places in 215 ms of which 3 ms to minimize.
[2024-06-01 14:16:02] [INFO ] Deduced a trap composed of 120 places in 221 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/1776 variables, and 53 constraints, problems are : Problem set: 0 solved, 1374 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 18/20 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/422 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1374 constraints, Known Traps: 13/13 constraints]
After SMT, in 65277ms problems are : Problem set: 0 solved, 1374 unsolved
Search for dead transitions found 0 dead transitions in 65290ms
Starting structural reductions in SI_LTL mode, iteration 1 : 422/600 places, 1378/1552 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 117519 ms. Remains : 422/600 places, 1378/1552 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J06T06-LTLCardinality-09
Product exploration explored 100000 steps with 4422 reset in 338 ms.
Product exploration explored 100000 steps with 4451 reset in 352 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 73 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 62 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 24 steps (0 resets) in 5 ms. (4 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 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 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 422/422 places, 1378/1378 transitions.
Applied a total of 0 rules in 17 ms. Remains 422 /422 variables (removed 0) and now considering 1378/1378 (removed 0) transitions.
Running 1374 sub problems to find dead transitions.
[2024-06-01 14:16:18] [INFO ] Flow matrix only has 1354 transitions (discarded 24 similar events)
[2024-06-01 14:16:18] [INFO ] Invariant cache hit.
[2024-06-01 14:16:18] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
[2024-06-01 14:16:32] [INFO ] Deduced a trap composed of 53 places in 85 ms of which 1 ms to minimize.
[2024-06-01 14:16:32] [INFO ] Deduced a trap composed of 53 places in 94 ms of which 2 ms to minimize.
[2024-06-01 14:16:32] [INFO ] Deduced a trap composed of 53 places in 72 ms of which 1 ms to minimize.
[2024-06-01 14:16:32] [INFO ] Deduced a trap composed of 53 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:16:32] [INFO ] Deduced a trap composed of 53 places in 48 ms of which 0 ms to minimize.
[2024-06-01 14:16:33] [INFO ] Deduced a trap composed of 195 places in 251 ms of which 2 ms to minimize.
[2024-06-01 14:16:33] [INFO ] Deduced a trap composed of 53 places in 33 ms of which 1 ms to minimize.
[2024-06-01 14:16:36] [INFO ] Deduced a trap composed of 222 places in 205 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/1776 variables, and 48 constraints, problems are : Problem set: 0 solved, 1374 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 18/20 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/422 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1374/1374 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1374 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 8/48 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
[2024-06-01 14:16:55] [INFO ] Deduced a trap composed of 33 places in 175 ms of which 2 ms to minimize.
[2024-06-01 14:16:57] [INFO ] Deduced a trap composed of 15 places in 221 ms of which 2 ms to minimize.
[2024-06-01 14:16:59] [INFO ] Deduced a trap composed of 133 places in 307 ms of which 3 ms to minimize.
[2024-06-01 14:16:59] [INFO ] Deduced a trap composed of 138 places in 300 ms of which 3 ms to minimize.
[2024-06-01 14:16:59] [INFO ] Deduced a trap composed of 217 places in 280 ms of which 3 ms to minimize.
[2024-06-01 14:17:00] [INFO ] Deduced a trap composed of 215 places in 292 ms of which 2 ms to minimize.
[2024-06-01 14:17:00] [INFO ] Deduced a trap composed of 134 places in 233 ms of which 2 ms to minimize.
[2024-06-01 14:17:01] [INFO ] Deduced a trap composed of 47 places in 199 ms of which 2 ms to minimize.
[2024-06-01 14:17:02] [INFO ] Deduced a trap composed of 63 places in 316 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/1776 variables, and 57 constraints, problems are : Problem set: 0 solved, 1374 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 18/20 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/422 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1374 constraints, Known Traps: 17/17 constraints]
After SMT, in 45104ms problems are : Problem set: 0 solved, 1374 unsolved
Search for dead transitions found 0 dead transitions in 45117ms
[2024-06-01 14:17:04] [INFO ] Flow matrix only has 1354 transitions (discarded 24 similar events)
[2024-06-01 14:17:04] [INFO ] Invariant cache hit.
[2024-06-01 14:17:04] [INFO ] Implicit Places using invariants in 406 ms returned []
[2024-06-01 14:17:04] [INFO ] Flow matrix only has 1354 transitions (discarded 24 similar events)
[2024-06-01 14:17:04] [INFO ] Invariant cache hit.
[2024-06-01 14:17:04] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:17:09] [INFO ] Implicit Places using invariants and state equation in 4824 ms returned []
Implicit Place search using SMT with State Equation took 5259 ms to find 0 implicit places.
[2024-06-01 14:17:09] [INFO ] Redundant transitions in 24 ms returned []
Running 1374 sub problems to find dead transitions.
[2024-06-01 14:17:09] [INFO ] Flow matrix only has 1354 transitions (discarded 24 similar events)
[2024-06-01 14:17:09] [INFO ] Invariant cache hit.
[2024-06-01 14:17:09] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
[2024-06-01 14:17:22] [INFO ] Deduced a trap composed of 53 places in 97 ms of which 1 ms to minimize.
[2024-06-01 14:17:22] [INFO ] Deduced a trap composed of 53 places in 88 ms of which 1 ms to minimize.
[2024-06-01 14:17:22] [INFO ] Deduced a trap composed of 53 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:17:22] [INFO ] Deduced a trap composed of 53 places in 50 ms of which 0 ms to minimize.
[2024-06-01 14:17:22] [INFO ] Deduced a trap composed of 53 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:17:23] [INFO ] Deduced a trap composed of 195 places in 225 ms of which 2 ms to minimize.
[2024-06-01 14:17:23] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:17:25] [INFO ] Deduced a trap composed of 222 places in 231 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 8/48 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
[2024-06-01 14:17:35] [INFO ] Deduced a trap composed of 33 places in 134 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/1776 variables, and 49 constraints, problems are : Problem set: 0 solved, 1374 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 18/20 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/422 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1374/1374 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1374 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
[2024-06-01 14:17:57] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 2 ms to minimize.
[2024-06-01 14:17:58] [INFO ] Deduced a trap composed of 138 places in 202 ms of which 2 ms to minimize.
[2024-06-01 14:17:58] [INFO ] Deduced a trap composed of 146 places in 200 ms of which 2 ms to minimize.
[2024-06-01 14:17:59] [INFO ] Deduced a trap composed of 120 places in 196 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/418 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
SMT process timed out in 65352ms, After SMT, problems are : Problem set: 0 solved, 1374 unsolved
Search for dead transitions found 0 dead transitions in 65370ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 115803 ms. Remains : 422/422 places, 1378/1378 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 89 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 53 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 23 steps (0 resets) in 4 ms. (4 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 67 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 45 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4433 reset in 335 ms.
Product exploration explored 100000 steps with 4409 reset in 346 ms.
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 422/422 places, 1378/1378 transitions.
Applied a total of 0 rules in 16 ms. Remains 422 /422 variables (removed 0) and now considering 1378/1378 (removed 0) transitions.
Running 1374 sub problems to find dead transitions.
[2024-06-01 14:18:15] [INFO ] Flow matrix only has 1354 transitions (discarded 24 similar events)
[2024-06-01 14:18:15] [INFO ] Invariant cache hit.
[2024-06-01 14:18:15] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
[2024-06-01 14:18:29] [INFO ] Deduced a trap composed of 53 places in 93 ms of which 2 ms to minimize.
[2024-06-01 14:18:29] [INFO ] Deduced a trap composed of 53 places in 77 ms of which 1 ms to minimize.
[2024-06-01 14:18:29] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 0 ms to minimize.
[2024-06-01 14:18:29] [INFO ] Deduced a trap composed of 53 places in 31 ms of which 1 ms to minimize.
[2024-06-01 14:18:29] [INFO ] Deduced a trap composed of 53 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:18:30] [INFO ] Deduced a trap composed of 195 places in 273 ms of which 2 ms to minimize.
[2024-06-01 14:18:30] [INFO ] Deduced a trap composed of 53 places in 52 ms of which 0 ms to minimize.
[2024-06-01 14:18:32] [INFO ] Deduced a trap composed of 222 places in 226 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/1776 variables, and 48 constraints, problems are : Problem set: 0 solved, 1374 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 18/20 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/422 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1374/1374 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1374 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 8/48 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
[2024-06-01 14:18:50] [INFO ] Deduced a trap composed of 33 places in 166 ms of which 2 ms to minimize.
[2024-06-01 14:18:53] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 1 ms to minimize.
[2024-06-01 14:18:54] [INFO ] Deduced a trap composed of 133 places in 197 ms of which 2 ms to minimize.
[2024-06-01 14:18:54] [INFO ] Deduced a trap composed of 138 places in 196 ms of which 2 ms to minimize.
[2024-06-01 14:18:55] [INFO ] Deduced a trap composed of 217 places in 193 ms of which 2 ms to minimize.
[2024-06-01 14:18:55] [INFO ] Deduced a trap composed of 215 places in 201 ms of which 3 ms to minimize.
[2024-06-01 14:18:55] [INFO ] Deduced a trap composed of 134 places in 213 ms of which 2 ms to minimize.
[2024-06-01 14:18:56] [INFO ] Deduced a trap composed of 47 places in 240 ms of which 3 ms to minimize.
[2024-06-01 14:18:57] [INFO ] Deduced a trap composed of 63 places in 221 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
(s296 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 5)
(s1 5)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 1)
(s9 1)
(s10 2)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 9)
(s129 1)
(s130 0)
(s131 1)
(s132 0)
(s133 0)
(s134 1)
(s135 0)
(s136 0)
(s137 1)
(s138 0)
(s139 0)
(s140 1)
(s141 0)
(s142 1)
(s143 0)
(s144 0)
(s145 0)
(s146 1)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 1)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 1)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 1)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 1)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 1)
(s266 0)
(s267 0)
(s268 1)
(s269 0)
(s270 0)
(s271 0)
(s272 4)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 1)
(s292 1)
(s293 0)
(s294 0)
(s295 0)
(s296 0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/1776 variables, and 57 constraints, problems are : Problem set: 0 solved, 1374 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 18/20 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/422 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1374 constraints, Known Traps: 17/17 constraints]
After SMT, in 45328ms problems are : Problem set: 0 solved, 1374 unsolved
Search for dead transitions found 0 dead transitions in 45340ms
[2024-06-01 14:19:01] [INFO ] Flow matrix only has 1354 transitions (discarded 24 similar events)
[2024-06-01 14:19:01] [INFO ] Invariant cache hit.
[2024-06-01 14:19:01] [INFO ] Implicit Places using invariants in 385 ms returned []
[2024-06-01 14:19:01] [INFO ] Flow matrix only has 1354 transitions (discarded 24 similar events)
[2024-06-01 14:19:01] [INFO ] Invariant cache hit.
[2024-06-01 14:19:02] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:19:06] [INFO ] Implicit Places using invariants and state equation in 5234 ms returned []
Implicit Place search using SMT with State Equation took 5642 ms to find 0 implicit places.
[2024-06-01 14:19:06] [INFO ] Redundant transitions in 16 ms returned []
Running 1374 sub problems to find dead transitions.
[2024-06-01 14:19:06] [INFO ] Flow matrix only has 1354 transitions (discarded 24 similar events)
[2024-06-01 14:19:06] [INFO ] Invariant cache hit.
[2024-06-01 14:19:06] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
[2024-06-01 14:19:19] [INFO ] Deduced a trap composed of 53 places in 114 ms of which 1 ms to minimize.
[2024-06-01 14:19:20] [INFO ] Deduced a trap composed of 53 places in 75 ms of which 1 ms to minimize.
[2024-06-01 14:19:20] [INFO ] Deduced a trap composed of 53 places in 64 ms of which 1 ms to minimize.
[2024-06-01 14:19:20] [INFO ] Deduced a trap composed of 53 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:19:20] [INFO ] Deduced a trap composed of 53 places in 68 ms of which 0 ms to minimize.
[2024-06-01 14:19:20] [INFO ] Deduced a trap composed of 195 places in 222 ms of which 2 ms to minimize.
[2024-06-01 14:19:21] [INFO ] Deduced a trap composed of 53 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:19:24] [INFO ] Deduced a trap composed of 222 places in 850 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 8/48 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
[2024-06-01 14:19:34] [INFO ] Deduced a trap composed of 33 places in 150 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 10.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 1.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 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 1.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 1.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 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/1776 variables, and 49 constraints, problems are : Problem set: 0 solved, 1374 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 18/20 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/422 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1374/1374 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1374 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
[2024-06-01 14:19:54] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 2 ms to minimize.
[2024-06-01 14:19:55] [INFO ] Deduced a trap composed of 138 places in 196 ms of which 2 ms to minimize.
[2024-06-01 14:19:55] [INFO ] Deduced a trap composed of 146 places in 233 ms of which 2 ms to minimize.
[2024-06-01 14:19:56] [INFO ] Deduced a trap composed of 120 places in 198 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/418 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 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 TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD687 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 TDEAD706 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD873 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/420 variables, 2/55 constraints. Problems are: Problem set: 174 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/1776 variables, and 55 constraints, problems are : Problem set: 174 solved, 1200 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/422 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1374 constraints, Known Traps: 13/13 constraints]
After SMT, in 65475ms problems are : Problem set: 174 solved, 1200 unsolved
Search for dead transitions found 174 dead transitions in 65505ms
Found 174 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 174 transitions
Dead transitions reduction (with SMT) removed 174 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 422/422 places, 1204/1378 transitions.
Applied a total of 0 rules in 13 ms. Remains 422 /422 variables (removed 0) and now considering 1204/1204 (removed 0) transitions.
[2024-06-01 14:20:12] [INFO ] Redundant transitions in 8 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 116569 ms. Remains : 422/422 places, 1204/1378 transitions.
Treatment of property PolyORBLF-COL-S04J06T06-LTLCardinality-09 finished in 352151 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 600/600 places, 1552/1552 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 596 transition count 1510
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 554 transition count 1510
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 84 place count 554 transition count 1438
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 228 place count 482 transition count 1438
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 348 place count 422 transition count 1378
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 354 place count 416 transition count 1372
Iterating global reduction 2 with 6 rules applied. Total rules applied 360 place count 416 transition count 1372
Applied a total of 360 rules in 107 ms. Remains 416 /600 variables (removed 184) and now considering 1372/1552 (removed 180) transitions.
Running 1368 sub problems to find dead transitions.
[2024-06-01 14:20:12] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
// Phase 1: matrix 1348 rows 416 cols
[2024-06-01 14:20:12] [INFO ] Computed 44 invariants in 28 ms
[2024-06-01 14:20:12] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/412 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/412 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-06-01 14:20:26] [INFO ] Deduced a trap composed of 52 places in 123 ms of which 2 ms to minimize.
[2024-06-01 14:20:26] [INFO ] Deduced a trap composed of 52 places in 103 ms of which 1 ms to minimize.
[2024-06-01 14:20:26] [INFO ] Deduced a trap composed of 52 places in 103 ms of which 1 ms to minimize.
[2024-06-01 14:20:26] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:20:26] [INFO ] Deduced a trap composed of 52 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:20:26] [INFO ] Deduced a trap composed of 193 places in 231 ms of which 2 ms to minimize.
[2024-06-01 14:20:26] [INFO ] Deduced a trap composed of 173 places in 243 ms of which 2 ms to minimize.
[2024-06-01 14:20:27] [INFO ] Deduced a trap composed of 52 places in 46 ms of which 0 ms to minimize.
[2024-06-01 14:20:28] [INFO ] Deduced a trap composed of 216 places in 206 ms of which 3 ms to minimize.
[2024-06-01 14:20:37] [INFO ] Deduced a trap composed of 45 places in 158 ms of which 1 ms to minimize.
[2024-06-01 14:20:38] [INFO ] Deduced a trap composed of 137 places in 229 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 412/1764 variables, and 51 constraints, problems are : Problem set: 0 solved, 1368 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/416 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1368/1368 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/412 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/412 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 11/51 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-06-01 14:20:40] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 1 ms to minimize.
[2024-06-01 14:20:53] [INFO ] Deduced a trap composed of 132 places in 207 ms of which 2 ms to minimize.
[2024-06-01 14:20:54] [INFO ] Deduced a trap composed of 164 places in 201 ms of which 2 ms to minimize.
[2024-06-01 14:20:54] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 412/1764 variables, and 55 constraints, problems are : Problem set: 0 solved, 1368 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/416 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1368 constraints, Known Traps: 15/15 constraints]
After SMT, in 46002ms problems are : Problem set: 0 solved, 1368 unsolved
Search for dead transitions found 0 dead transitions in 46025ms
[2024-06-01 14:20:58] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
[2024-06-01 14:20:58] [INFO ] Invariant cache hit.
[2024-06-01 14:20:58] [INFO ] Implicit Places using invariants in 323 ms returned []
[2024-06-01 14:20:58] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
[2024-06-01 14:20:58] [INFO ] Invariant cache hit.
[2024-06-01 14:20:59] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:21:03] [INFO ] Implicit Places using invariants and state equation in 5125 ms returned []
Implicit Place search using SMT with State Equation took 5466 ms to find 0 implicit places.
[2024-06-01 14:21:04] [INFO ] Redundant transitions in 11 ms returned []
Running 1368 sub problems to find dead transitions.
[2024-06-01 14:21:04] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
[2024-06-01 14:21:04] [INFO ] Invariant cache hit.
[2024-06-01 14:21:04] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/412 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/412 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-06-01 14:21:16] [INFO ] Deduced a trap composed of 52 places in 92 ms of which 1 ms to minimize.
[2024-06-01 14:21:16] [INFO ] Deduced a trap composed of 52 places in 88 ms of which 1 ms to minimize.
[2024-06-01 14:21:16] [INFO ] Deduced a trap composed of 52 places in 68 ms of which 0 ms to minimize.
[2024-06-01 14:21:16] [INFO ] Deduced a trap composed of 52 places in 49 ms of which 0 ms to minimize.
[2024-06-01 14:21:16] [INFO ] Deduced a trap composed of 52 places in 42 ms of which 0 ms to minimize.
[2024-06-01 14:21:17] [INFO ] Deduced a trap composed of 205 places in 216 ms of which 2 ms to minimize.
[2024-06-01 14:21:17] [INFO ] Deduced a trap composed of 188 places in 227 ms of which 2 ms to minimize.
[2024-06-01 14:21:17] [INFO ] Deduced a trap composed of 52 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:21:27] [INFO ] Deduced a trap composed of 164 places in 299 ms of which 2 ms to minimize.
[2024-06-01 14:21:28] [INFO ] Deduced a trap composed of 15 places in 755 ms of which 2 ms to minimize.
[2024-06-01 14:21:29] [INFO ] Deduced a trap composed of 141 places in 201 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 11/51 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-06-01 14:21:32] [INFO ] Deduced a trap composed of 216 places in 202 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 412/1764 variables, and 52 constraints, problems are : Problem set: 0 solved, 1368 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/416 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1368/1368 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/412 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/412 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 12/52 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-06-01 14:21:41] [INFO ] Deduced a trap composed of 182 places in 232 ms of which 2 ms to minimize.
[2024-06-01 14:21:53] [INFO ] Deduced a trap composed of 127 places in 207 ms of which 3 ms to minimize.
[2024-06-01 14:21:53] [INFO ] Deduced a trap composed of 132 places in 220 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-06-01 14:22:04] [INFO ] Deduced a trap composed of 27 places in 188 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 412/1764 variables, and 56 constraints, problems are : Problem set: 0 solved, 1368 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/416 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1368 constraints, Known Traps: 16/16 constraints]
After SMT, in 65421ms problems are : Problem set: 0 solved, 1368 unsolved
Search for dead transitions found 0 dead transitions in 65433ms
Starting structural reductions in SI_LTL mode, iteration 1 : 416/600 places, 1372/1552 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 117061 ms. Remains : 416/600 places, 1372/1552 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J06T06-LTLCardinality-10
Stuttering criterion allowed to conclude after 37039 steps with 170 reset in 142 ms.
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S04J06T06-LTLCardinality-10 finished in 117275 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 17 out of 600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 600/600 places, 1552/1552 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 596 transition count 1552
Applied a total of 4 rules in 9 ms. Remains 596 /600 variables (removed 4) and now considering 1552/1552 (removed 0) transitions.
Running 1548 sub problems to find dead transitions.
[2024-06-01 14:22:09] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
// Phase 1: matrix 1528 rows 596 cols
[2024-06-01 14:22:09] [INFO ] Computed 44 invariants in 40 ms
[2024-06-01 14:22:09] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-06-01 14:22:26] [INFO ] Deduced a trap composed of 82 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:22:26] [INFO ] Deduced a trap composed of 82 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:22:26] [INFO ] Deduced a trap composed of 82 places in 64 ms of which 1 ms to minimize.
[2024-06-01 14:22:26] [INFO ] Deduced a trap composed of 82 places in 65 ms of which 0 ms to minimize.
[2024-06-01 14:22:27] [INFO ] Deduced a trap composed of 82 places in 63 ms of which 0 ms to minimize.
[2024-06-01 14:22:27] [INFO ] Deduced a trap composed of 339 places in 275 ms of which 3 ms to minimize.
[2024-06-01 14:22:27] [INFO ] Deduced a trap composed of 351 places in 247 ms of which 3 ms to minimize.
[2024-06-01 14:22:28] [INFO ] Deduced a trap composed of 339 places in 262 ms of which 3 ms to minimize.
[2024-06-01 14:22:28] [INFO ] Deduced a trap composed of 108 places in 228 ms of which 3 ms to minimize.
[2024-06-01 14:22:28] [INFO ] Deduced a trap composed of 82 places in 241 ms of which 2 ms to minimize.
[2024-06-01 14:22:28] [INFO ] Deduced a trap composed of 139 places in 243 ms of which 3 ms to minimize.
[2024-06-01 14:22:29] [INFO ] Deduced a trap composed of 295 places in 395 ms of which 5 ms to minimize.
[2024-06-01 14:22:30] [INFO ] Deduced a trap composed of 315 places in 351 ms of which 4 ms to minimize.
[2024-06-01 14:22:31] [INFO ] Deduced a trap composed of 374 places in 491 ms of which 5 ms to minimize.
[2024-06-01 14:22:32] [INFO ] Deduced a trap composed of 343 places in 480 ms of which 4 ms to minimize.
[2024-06-01 14:22:33] [INFO ] Deduced a trap composed of 309 places in 910 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2124 variables, and 56 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 16/18 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-06-01 14:22:38] [INFO ] Deduced a trap composed of 338 places in 313 ms of which 4 ms to minimize.
[2024-06-01 14:22:39] [INFO ] Deduced a trap composed of 322 places in 360 ms of which 4 ms to minimize.
[2024-06-01 14:22:45] [INFO ] Deduced a trap composed of 360 places in 244 ms of which 3 ms to minimize.
[2024-06-01 14:22:45] [INFO ] Deduced a trap composed of 300 places in 246 ms of which 3 ms to minimize.
[2024-06-01 14:22:55] [INFO ] Deduced a trap composed of 282 places in 273 ms of which 3 ms to minimize.
SMT process timed out in 46143ms, After SMT, problems are : Problem set: 0 solved, 1548 unsolved
Search for dead transitions found 0 dead transitions in 46157ms
[2024-06-01 14:22:55] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-06-01 14:22:55] [INFO ] Invariant cache hit.
[2024-06-01 14:22:56] [INFO ] Implicit Places using invariants in 394 ms returned []
[2024-06-01 14:22:56] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-06-01 14:22:56] [INFO ] Invariant cache hit.
[2024-06-01 14:22:57] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:23:04] [INFO ] Implicit Places using invariants and state equation in 8611 ms returned []
Implicit Place search using SMT with State Equation took 9019 ms to find 0 implicit places.
Running 1548 sub problems to find dead transitions.
[2024-06-01 14:23:04] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-06-01 14:23:04] [INFO ] Invariant cache hit.
[2024-06-01 14:23:04] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-06-01 14:23:22] [INFO ] Deduced a trap composed of 82 places in 53 ms of which 0 ms to minimize.
[2024-06-01 14:23:22] [INFO ] Deduced a trap composed of 82 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:23:22] [INFO ] Deduced a trap composed of 82 places in 64 ms of which 6 ms to minimize.
[2024-06-01 14:23:22] [INFO ] Deduced a trap composed of 82 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:23:22] [INFO ] Deduced a trap composed of 82 places in 54 ms of which 0 ms to minimize.
[2024-06-01 14:23:23] [INFO ] Deduced a trap composed of 360 places in 265 ms of which 3 ms to minimize.
[2024-06-01 14:23:23] [INFO ] Deduced a trap composed of 413 places in 258 ms of which 3 ms to minimize.
[2024-06-01 14:23:23] [INFO ] Deduced a trap composed of 351 places in 263 ms of which 3 ms to minimize.
[2024-06-01 14:23:24] [INFO ] Deduced a trap composed of 353 places in 345 ms of which 4 ms to minimize.
[2024-06-01 14:23:24] [INFO ] Deduced a trap composed of 363 places in 263 ms of which 3 ms to minimize.
[2024-06-01 14:23:24] [INFO ] Deduced a trap composed of 141 places in 250 ms of which 3 ms to minimize.
[2024-06-01 14:23:24] [INFO ] Deduced a trap composed of 82 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:23:25] [INFO ] Deduced a trap composed of 304 places in 282 ms of which 3 ms to minimize.
[2024-06-01 14:23:26] [INFO ] Deduced a trap composed of 39 places in 246 ms of which 2 ms to minimize.
[2024-06-01 14:23:27] [INFO ] Deduced a trap composed of 346 places in 415 ms of which 5 ms to minimize.
[2024-06-01 14:23:27] [INFO ] Deduced a trap composed of 328 places in 402 ms of which 4 ms to minimize.
[2024-06-01 14:23:27] [INFO ] Deduced a trap composed of 346 places in 371 ms of which 4 ms to minimize.
[2024-06-01 14:23:28] [INFO ] Deduced a trap composed of 92 places in 264 ms of which 3 ms to minimize.
[2024-06-01 14:23:28] [INFO ] Deduced a trap composed of 330 places in 270 ms of which 2 ms to minimize.
[2024-06-01 14:23:28] [INFO ] Deduced a trap composed of 315 places in 266 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-06-01 14:23:30] [INFO ] Deduced a trap composed of 313 places in 389 ms of which 5 ms to minimize.
[2024-06-01 14:23:36] [INFO ] Deduced a trap composed of 360 places in 245 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2124 variables, and 62 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 16/18 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 22/62 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-06-01 14:23:43] [INFO ] Deduced a trap composed of 16 places in 159 ms of which 2 ms to minimize.
[2024-06-01 14:23:43] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 592/2124 variables, and 64 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 16/18 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 24/24 constraints]
After SMT, in 65323ms problems are : Problem set: 0 solved, 1548 unsolved
Search for dead transitions found 0 dead transitions in 65338ms
Starting structural reductions in LTL mode, iteration 1 : 596/600 places, 1552/1552 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 120532 ms. Remains : 596/600 places, 1552/1552 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J06T06-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S04J06T06-LTLCardinality-11 finished in 120640 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 6 out of 600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 600/600 places, 1552/1552 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 596 transition count 1552
Applied a total of 4 rules in 9 ms. Remains 596 /600 variables (removed 4) and now considering 1552/1552 (removed 0) transitions.
Running 1548 sub problems to find dead transitions.
[2024-06-01 14:24:10] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
// Phase 1: matrix 1528 rows 596 cols
[2024-06-01 14:24:10] [INFO ] Computed 44 invariants in 17 ms
[2024-06-01 14:24:10] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-06-01 14:24:26] [INFO ] Deduced a trap composed of 82 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:24:26] [INFO ] Deduced a trap composed of 82 places in 50 ms of which 0 ms to minimize.
[2024-06-01 14:24:27] [INFO ] Deduced a trap composed of 82 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:24:27] [INFO ] Deduced a trap composed of 82 places in 81 ms of which 1 ms to minimize.
[2024-06-01 14:24:27] [INFO ] Deduced a trap composed of 82 places in 89 ms of which 2 ms to minimize.
[2024-06-01 14:24:27] [INFO ] Deduced a trap composed of 398 places in 333 ms of which 3 ms to minimize.
[2024-06-01 14:24:28] [INFO ] Deduced a trap composed of 359 places in 421 ms of which 5 ms to minimize.
[2024-06-01 14:24:28] [INFO ] Deduced a trap composed of 348 places in 404 ms of which 5 ms to minimize.
[2024-06-01 14:24:29] [INFO ] Deduced a trap composed of 139 places in 367 ms of which 4 ms to minimize.
[2024-06-01 14:24:29] [INFO ] Deduced a trap composed of 82 places in 321 ms of which 5 ms to minimize.
[2024-06-01 14:24:29] [INFO ] Deduced a trap composed of 160 places in 385 ms of which 4 ms to minimize.
[2024-06-01 14:24:30] [INFO ] Deduced a trap composed of 304 places in 270 ms of which 3 ms to minimize.
[2024-06-01 14:24:30] [INFO ] Deduced a trap composed of 328 places in 255 ms of which 3 ms to minimize.
[2024-06-01 14:24:31] [INFO ] Deduced a trap composed of 429 places in 270 ms of which 3 ms to minimize.
[2024-06-01 14:24:32] [INFO ] Deduced a trap composed of 366 places in 270 ms of which 3 ms to minimize.
[2024-06-01 14:24:32] [INFO ] Deduced a trap composed of 375 places in 266 ms of which 3 ms to minimize.
[2024-06-01 14:24:32] [INFO ] Deduced a trap composed of 355 places in 265 ms of which 3 ms to minimize.
[2024-06-01 14:24:33] [INFO ] Deduced a trap composed of 371 places in 261 ms of which 3 ms to minimize.
[2024-06-01 14:24:33] [INFO ] Deduced a trap composed of 340 places in 259 ms of which 3 ms to minimize.
[2024-06-01 14:24:33] [INFO ] Deduced a trap composed of 358 places in 256 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2124 variables, and 60 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-06-01 14:24:38] [INFO ] Deduced a trap composed of 41 places in 152 ms of which 1 ms to minimize.
[2024-06-01 14:24:45] [INFO ] Deduced a trap composed of 382 places in 265 ms of which 3 ms to minimize.
[2024-06-01 14:24:45] [INFO ] Deduced a trap composed of 362 places in 250 ms of which 3 ms to minimize.
[2024-06-01 14:24:47] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 592/2124 variables, and 64 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 24/24 constraints]
After SMT, in 45483ms problems are : Problem set: 0 solved, 1548 unsolved
Search for dead transitions found 0 dead transitions in 45511ms
[2024-06-01 14:24:55] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-06-01 14:24:55] [INFO ] Invariant cache hit.
[2024-06-01 14:24:56] [INFO ] Implicit Places using invariants in 560 ms returned []
[2024-06-01 14:24:56] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-06-01 14:24:56] [INFO ] Invariant cache hit.
[2024-06-01 14:24:56] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:25:04] [INFO ] Implicit Places using invariants and state equation in 7716 ms returned []
Implicit Place search using SMT with State Equation took 8294 ms to find 0 implicit places.
Running 1548 sub problems to find dead transitions.
[2024-06-01 14:25:04] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-06-01 14:25:04] [INFO ] Invariant cache hit.
[2024-06-01 14:25:04] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-06-01 14:25:20] [INFO ] Deduced a trap composed of 82 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:25:20] [INFO ] Deduced a trap composed of 82 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:25:20] [INFO ] Deduced a trap composed of 82 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:25:20] [INFO ] Deduced a trap composed of 82 places in 64 ms of which 1 ms to minimize.
[2024-06-01 14:25:20] [INFO ] Deduced a trap composed of 82 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:25:21] [INFO ] Deduced a trap composed of 360 places in 244 ms of which 3 ms to minimize.
[2024-06-01 14:25:21] [INFO ] Deduced a trap composed of 359 places in 266 ms of which 4 ms to minimize.
[2024-06-01 14:25:21] [INFO ] Deduced a trap composed of 263 places in 238 ms of which 3 ms to minimize.
[2024-06-01 14:25:21] [INFO ] Deduced a trap composed of 82 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:25:22] [INFO ] Deduced a trap composed of 288 places in 263 ms of which 2 ms to minimize.
[2024-06-01 14:25:23] [INFO ] Deduced a trap composed of 362 places in 552 ms of which 6 ms to minimize.
[2024-06-01 14:25:24] [INFO ] Deduced a trap composed of 362 places in 482 ms of which 5 ms to minimize.
[2024-06-01 14:25:24] [INFO ] Deduced a trap composed of 355 places in 391 ms of which 3 ms to minimize.
[2024-06-01 14:25:25] [INFO ] Deduced a trap composed of 350 places in 296 ms of which 3 ms to minimize.
[2024-06-01 14:25:25] [INFO ] Deduced a trap composed of 342 places in 270 ms of which 3 ms to minimize.
[2024-06-01 14:25:25] [INFO ] Deduced a trap composed of 330 places in 274 ms of which 3 ms to minimize.
[2024-06-01 14:25:26] [INFO ] Deduced a trap composed of 339 places in 265 ms of which 3 ms to minimize.
[2024-06-01 14:25:26] [INFO ] Deduced a trap composed of 305 places in 295 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2124 variables, and 58 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-06-01 14:25:41] [INFO ] Deduced a trap composed of 334 places in 272 ms of which 3 ms to minimize.
[2024-06-01 14:25:42] [INFO ] Deduced a trap composed of 169 places in 149 ms of which 2 ms to minimize.
[2024-06-01 14:25:48] [INFO ] Deduced a trap composed of 366 places in 312 ms of which 4 ms to minimize.
[2024-06-01 14:25:48] [INFO ] Deduced a trap composed of 366 places in 285 ms of which 3 ms to minimize.
[2024-06-01 14:25:50] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 2 ms to minimize.
[2024-06-01 14:26:01] [INFO ] Deduced a trap composed of 414 places in 242 ms of which 3 ms to minimize.
[2024-06-01 14:26:02] [INFO ] Deduced a trap composed of 65 places in 270 ms of which 3 ms to minimize.
[2024-06-01 14:26:02] [INFO ] Deduced a trap composed of 42 places in 281 ms of which 3 ms to minimize.
[2024-06-01 14:26:05] [INFO ] Deduced a trap composed of 358 places in 302 ms of which 3 ms to minimize.
[2024-06-01 14:26:05] [INFO ] Deduced a trap composed of 313 places in 282 ms of which 3 ms to minimize.
[2024-06-01 14:26:06] [INFO ] Deduced a trap composed of 291 places in 242 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 10)
(s147 1)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 1)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 1)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 1)
(s286 0)
(s287 0)
(s288 1)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s303 1)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 592/2124 variables, and 69 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 29/29 constraints]
After SMT, in 65266ms problems are : Problem set: 0 solved, 1548 unsolved
Search for dead transitions found 0 dead transitions in 65281ms
Starting structural reductions in LTL mode, iteration 1 : 596/600 places, 1552/1552 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 119103 ms. Remains : 596/600 places, 1552/1552 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J06T06-LTLCardinality-13
Product exploration explored 100000 steps with 50000 reset in 498 ms.
Product exploration explored 100000 steps with 50000 reset in 497 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 31 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S04J06T06-LTLCardinality-13 finished in 120224 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(G(!p0)))))'
Support contains 43 out of 600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 600/600 places, 1552/1552 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 596 transition count 1510
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 554 transition count 1510
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 84 place count 554 transition count 1480
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 144 place count 524 transition count 1480
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 264 place count 464 transition count 1420
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 270 place count 458 transition count 1414
Iterating global reduction 2 with 6 rules applied. Total rules applied 276 place count 458 transition count 1414
Applied a total of 276 rules in 98 ms. Remains 458 /600 variables (removed 142) and now considering 1414/1552 (removed 138) transitions.
Running 1410 sub problems to find dead transitions.
[2024-06-01 14:26:10] [INFO ] Flow matrix only has 1390 transitions (discarded 24 similar events)
// Phase 1: matrix 1390 rows 458 cols
[2024-06-01 14:26:10] [INFO ] Computed 44 invariants in 21 ms
[2024-06-01 14:26:10] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-06-01 14:26:25] [INFO ] Deduced a trap composed of 59 places in 80 ms of which 1 ms to minimize.
[2024-06-01 14:26:25] [INFO ] Deduced a trap composed of 59 places in 91 ms of which 1 ms to minimize.
[2024-06-01 14:26:26] [INFO ] Deduced a trap composed of 59 places in 89 ms of which 1 ms to minimize.
[2024-06-01 14:26:26] [INFO ] Deduced a trap composed of 59 places in 50 ms of which 0 ms to minimize.
[2024-06-01 14:26:26] [INFO ] Deduced a trap composed of 59 places in 48 ms of which 0 ms to minimize.
[2024-06-01 14:26:26] [INFO ] Deduced a trap composed of 238 places in 264 ms of which 2 ms to minimize.
[2024-06-01 14:26:26] [INFO ] Deduced a trap composed of 232 places in 339 ms of which 2 ms to minimize.
[2024-06-01 14:26:27] [INFO ] Deduced a trap composed of 216 places in 229 ms of which 3 ms to minimize.
[2024-06-01 14:26:27] [INFO ] Deduced a trap composed of 250 places in 345 ms of which 3 ms to minimize.
[2024-06-01 14:26:27] [INFO ] Deduced a trap composed of 302 places in 219 ms of which 3 ms to minimize.
[2024-06-01 14:26:28] [INFO ] Deduced a trap composed of 261 places in 373 ms of which 4 ms to minimize.
[2024-06-01 14:26:28] [INFO ] Deduced a trap composed of 252 places in 334 ms of which 3 ms to minimize.
[2024-06-01 14:26:29] [INFO ] Deduced a trap composed of 59 places in 49 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1848 variables, and 53 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/458 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1410/1410 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1410 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-06-01 14:26:38] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2024-06-01 14:26:40] [INFO ] Deduced a trap composed of 258 places in 219 ms of which 2 ms to minimize.
[2024-06-01 14:26:41] [INFO ] Deduced a trap composed of 15 places in 376 ms of which 3 ms to minimize.
[2024-06-01 14:26:41] [INFO ] Deduced a trap composed of 231 places in 283 ms of which 2 ms to minimize.
[2024-06-01 14:26:42] [INFO ] Deduced a trap composed of 220 places in 384 ms of which 3 ms to minimize.
[2024-06-01 14:26:53] [INFO ] Deduced a trap composed of 45 places in 153 ms of which 1 ms to minimize.
[2024-06-01 14:26:54] [INFO ] Deduced a trap composed of 212 places in 232 ms of which 2 ms to minimize.
[2024-06-01 14:26:54] [INFO ] Deduced a trap composed of 174 places in 255 ms of which 2 ms to minimize.
[2024-06-01 14:26:55] [INFO ] Deduced a trap composed of 175 places in 224 ms of which 3 ms to minimize.
[2024-06-01 14:26:55] [INFO ] Deduced a trap composed of 228 places in 200 ms of which 2 ms to minimize.
[2024-06-01 14:26:56] [INFO ] Deduced a trap composed of 219 places in 244 ms of which 2 ms to minimize.
[2024-06-01 14:26:56] [INFO ] Deduced a trap composed of 32 places in 236 ms of which 3 ms to minimize.
[2024-06-01 14:26:56] [INFO ] Deduced a trap composed of 78 places in 234 ms of which 3 ms to minimize.
SMT process timed out in 46110ms, After SMT, problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 46128ms
[2024-06-01 14:26:56] [INFO ] Flow matrix only has 1390 transitions (discarded 24 similar events)
[2024-06-01 14:26:56] [INFO ] Invariant cache hit.
[2024-06-01 14:26:57] [INFO ] Implicit Places using invariants in 294 ms returned []
[2024-06-01 14:26:57] [INFO ] Flow matrix only has 1390 transitions (discarded 24 similar events)
[2024-06-01 14:26:57] [INFO ] Invariant cache hit.
[2024-06-01 14:26:57] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:27:04] [INFO ] Implicit Places using invariants and state equation in 7199 ms returned []
Implicit Place search using SMT with State Equation took 7507 ms to find 0 implicit places.
[2024-06-01 14:27:04] [INFO ] Redundant transitions in 12 ms returned []
Running 1410 sub problems to find dead transitions.
[2024-06-01 14:27:04] [INFO ] Flow matrix only has 1390 transitions (discarded 24 similar events)
[2024-06-01 14:27:04] [INFO ] Invariant cache hit.
[2024-06-01 14:27:04] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-06-01 14:27:18] [INFO ] Deduced a trap composed of 59 places in 119 ms of which 2 ms to minimize.
[2024-06-01 14:27:18] [INFO ] Deduced a trap composed of 59 places in 119 ms of which 2 ms to minimize.
[2024-06-01 14:27:18] [INFO ] Deduced a trap composed of 59 places in 83 ms of which 1 ms to minimize.
[2024-06-01 14:27:18] [INFO ] Deduced a trap composed of 59 places in 80 ms of which 1 ms to minimize.
[2024-06-01 14:27:18] [INFO ] Deduced a trap composed of 59 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:27:18] [INFO ] Deduced a trap composed of 234 places in 263 ms of which 3 ms to minimize.
[2024-06-01 14:27:19] [INFO ] Deduced a trap composed of 241 places in 248 ms of which 2 ms to minimize.
[2024-06-01 14:27:19] [INFO ] Deduced a trap composed of 216 places in 251 ms of which 2 ms to minimize.
[2024-06-01 14:27:19] [INFO ] Deduced a trap composed of 258 places in 237 ms of which 3 ms to minimize.
[2024-06-01 14:27:19] [INFO ] Deduced a trap composed of 239 places in 234 ms of which 2 ms to minimize.
[2024-06-01 14:27:20] [INFO ] Deduced a trap composed of 246 places in 254 ms of which 2 ms to minimize.
[2024-06-01 14:27:20] [INFO ] Deduced a trap composed of 251 places in 233 ms of which 3 ms to minimize.
[2024-06-01 14:27:20] [INFO ] Deduced a trap composed of 219 places in 234 ms of which 2 ms to minimize.
[2024-06-01 14:27:21] [INFO ] Deduced a trap composed of 59 places in 55 ms of which 2 ms to minimize.
[2024-06-01 14:27:30] [INFO ] Deduced a trap composed of 261 places in 236 ms of which 2 ms to minimize.
[2024-06-01 14:27:32] [INFO ] Deduced a trap composed of 146 places in 234 ms of which 3 ms to minimize.
[2024-06-01 14:27:33] [INFO ] Deduced a trap composed of 210 places in 213 ms of which 3 ms to minimize.
[2024-06-01 14:27:33] [INFO ] Deduced a trap composed of 3 places in 214 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1848 variables, and 58 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/458 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1410/1410 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1410 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-06-01 14:27:44] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 1 ms to minimize.
[2024-06-01 14:27:55] [INFO ] Deduced a trap composed of 174 places in 211 ms of which 3 ms to minimize.
[2024-06-01 14:27:55] [INFO ] Deduced a trap composed of 18 places in 165 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-06-01 14:28:00] [INFO ] Deduced a trap composed of 37 places in 196 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1848 variables, and 62 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/458 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1410 constraints, Known Traps: 22/22 constraints]
After SMT, in 65545ms problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 65559ms
Starting structural reductions in SI_LTL mode, iteration 1 : 458/600 places, 1414/1552 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 119321 ms. Remains : 458/600 places, 1414/1552 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), p0]
Running random walk in product with property : PolyORBLF-COL-S04J06T06-LTLCardinality-14
Product exploration explored 100000 steps with 9 reset in 414 ms.
Stack based approach found an accepted trace after 1770 steps with 0 reset with depth 1771 and stack size 1771 in 9 ms.
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-COL-S04J06T06-LTLCardinality-14 finished in 119868 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-06-01 14:28:10] [INFO ] Flatten gal took : 107 ms
[2024-06-01 14:28:10] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 14 ms.
[2024-06-01 14:28:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 600 places, 1552 transitions and 7776 arcs took 24 ms.
Total runtime 1801456 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-03 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-09 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717253177169

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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
mcc2024
ltl formula name PolyORBLF-COL-S04J06T06-LTLCardinality-03
ltl formula formula --ltl=/tmp/3267/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 600 places, 1552 transitions and 7776 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.290 real 0.050 user 0.060 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3267/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3267/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3267/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3267/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 621 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 601, there are 1557 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~317!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 405
pnml2lts-mc( 0/ 4): unique states count: 1952
pnml2lts-mc( 0/ 4): unique transitions count: 4369
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 276
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 1955
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1554
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1955 states 4385 transitions, fanout: 2.243
pnml2lts-mc( 0/ 4): Total exploration time 0.190 sec (0.170 sec minimum, 0.178 sec on average)
pnml2lts-mc( 0/ 4): States per second: 10289, Transitions per second: 23079
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 41.9 B/state, compr.: 1.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1582 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~256.0MB paged-in)
ltl formula name PolyORBLF-COL-S04J06T06-LTLCardinality-09
ltl formula formula --ltl=/tmp/3267/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 600 places, 1552 transitions and 7776 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.220 real 0.040 user 0.040 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3267/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3267/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3267/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3267/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 621 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 601, there are 1555 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~23 levels ~10000 states ~17728 transitions
pnml2lts-mc( 0/ 4): ~61 levels ~20000 states ~51612 transitions
pnml2lts-mc( 3/ 4): ~61 levels ~40000 states ~101840 transitions
pnml2lts-mc( 3/ 4): ~61 levels ~80000 states ~211612 transitions
pnml2lts-mc( 3/ 4): ~61 levels ~160000 states ~424868 transitions
pnml2lts-mc( 3/ 4): ~61 levels ~320000 states ~859280 transitions
pnml2lts-mc( 1/ 4): ~32 levels ~640000 states ~1703708 transitions
pnml2lts-mc( 1/ 4): ~260 levels ~1280000 states ~3641532 transitions
pnml2lts-mc( 0/ 4): ~1687 levels ~2560000 states ~7438092 transitions
pnml2lts-mc( 1/ 4): ~260 levels ~5120000 states ~16999412 transitions
pnml2lts-mc( 2/ 4): ~171 levels ~10240000 states ~38564308 transitions
pnml2lts-mc( 2/ 4): ~2722 levels ~20480000 states ~76695084 transitions
pnml2lts-mc( 0/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33542435
pnml2lts-mc( 0/ 4): unique states count: 33548041
pnml2lts-mc( 0/ 4): unique transitions count: 122544249
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 88989141
pnml2lts-mc( 0/ 4): - claim found count: 607
pnml2lts-mc( 0/ 4): - claim success count: 33548044
pnml2lts-mc( 0/ 4): - cum. max stack depth: 5571
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33548044 states 122544263 transitions, fanout: 3.653
pnml2lts-mc( 0/ 4): Total exploration time 1084.410 sec (1084.400 sec minimum, 1084.405 sec on average)
pnml2lts-mc( 0/ 4): States per second: 30937, Transitions per second: 113005
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 262.4MB, 8.2 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/9.0%
pnml2lts-mc( 0/ 4): Stored 1582 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 262.4MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-COL-S04J06T06"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is PolyORBLF-COL-S04J06T06, 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 r516-tajo-171654446500147"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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