MCC'2024- Execution of r289-tajo-171654445200124

About the Execution of GreatSPN+red for PolyORBLF-COL-S04J04T06

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
16034.983	3600000.00	6991220.00	1056.70	?T?TFFF??FTFTF?F	normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 8.9K Apr 11 17:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 11 17:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 11 17:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 11 17:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 17:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 11 17:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 11 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716849229307

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S04J04T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 22:33:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-27 22:33:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 22:33:51] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-27 22:33:51] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 22:33:51] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 722 ms
[2024-05-27 22:33:51] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 554 PT places and 3040.0 transition bindings in 28 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2024-05-27 22:33:52] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 13 ms.
[2024-05-27 22:33:52] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 3 formulas.
FORMULA PolyORBLF-COL-S04J04T06-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T06-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T06-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 1009 steps (0 resets) in 124 ms. (8 steps per ms) remains 0/24 properties
[2024-05-27 22:33:52] [INFO ] Flatten gal took : 76 ms
[2024-05-27 22:33:52] [INFO ] Flatten gal took : 25 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-05-27 22:33:53] [INFO ] Unfolded HLPN to a Petri net with 554 places and 2998 transitions 20754 arcs in 187 ms.
[2024-05-27 22:33:53] [INFO ] Unfolded 13 HLPN properties in 2 ms.
Ensure Unique test removed 1626 transitions
Reduce redundant transitions removed 1626 transitions.
Support contains 226 out of 554 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 554/554 places, 1372/1372 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 550 transition count 1372
Applied a total of 4 rules in 146 ms. Remains 550 /554 variables (removed 4) and now considering 1372/1372 (removed 0) transitions.
Running 1368 sub problems to find dead transitions.
[2024-05-27 22:33:53] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
// Phase 1: matrix 1348 rows 550 cols
[2024-05-27 22:33:53] [INFO ] Computed 46 invariants in 125 ms
[2024-05-27 22:33:53] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/546 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/546 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-05-27 22:34:13] [INFO ] Deduced a trap composed of 75 places in 186 ms of which 27 ms to minimize.
[2024-05-27 22:34:13] [INFO ] Deduced a trap composed of 75 places in 155 ms of which 4 ms to minimize.
[2024-05-27 22:34:13] [INFO ] Deduced a trap composed of 75 places in 226 ms of which 2 ms to minimize.
[2024-05-27 22:34:13] [INFO ] Deduced a trap composed of 75 places in 105 ms of which 2 ms to minimize.
[2024-05-27 22:34:14] [INFO ] Deduced a trap composed of 75 places in 57 ms of which 1 ms to minimize.
[2024-05-27 22:34:14] [INFO ] Deduced a trap composed of 313 places in 549 ms of which 12 ms to minimize.
[2024-05-27 22:34:15] [INFO ] Deduced a trap composed of 167 places in 393 ms of which 11 ms to minimize.
[2024-05-27 22:34:17] [INFO ] Deduced a trap composed of 39 places in 237 ms of which 3 ms to minimize.
[2024-05-27 22:34:18] [INFO ] Deduced a trap composed of 319 places in 412 ms of which 4 ms to minimize.
[2024-05-27 22:34:19] [INFO ] Deduced a trap composed of 320 places in 1143 ms of which 3 ms to minimize.
[2024-05-27 22:34:19] [INFO ] Deduced a trap composed of 317 places in 488 ms of which 7 ms to minimize.
[2024-05-27 22:34:20] [INFO ] Deduced a trap composed of 323 places in 620 ms of which 6 ms to minimize.
SMT process timed out in 26758ms, After SMT, problems are : Problem set: 0 solved, 1368 unsolved
Search for dead transitions found 0 dead transitions in 26853ms
[2024-05-27 22:34:20] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
[2024-05-27 22:34:20] [INFO ] Invariant cache hit.
[2024-05-27 22:34:21] [INFO ] Implicit Places using invariants in 641 ms returned [428, 429, 430, 431, 432, 433]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 670 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 544/554 places, 1372/1372 transitions.
Applied a total of 0 rules in 52 ms. Remains 544 /544 variables (removed 0) and now considering 1372/1372 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 27885 ms. Remains : 544/554 places, 1372/1372 transitions.
Support contains 226 out of 544 places after structural reductions.
[2024-05-27 22:34:21] [INFO ] Flatten gal took : 214 ms
[2024-05-27 22:34:21] [INFO ] Flatten gal took : 156 ms
[2024-05-27 22:34:22] [INFO ] Input system was already deterministic with 1372 transitions.
RANDOM walk for 972 steps (0 resets) in 126 ms. (7 steps per ms) remains 0/24 properties
FORMULA PolyORBLF-COL-S04J04T06-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!((G(p0)||((F(p1) U p2) U p3)))'
Support contains 52 out of 544 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 544/544 places, 1372/1372 transitions.
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 544 transition count 1342
Reduce places removed 30 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 36 rules applied. Total rules applied 66 place count 514 transition count 1336
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 72 place count 508 transition count 1336
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 72 place count 508 transition count 1270
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 204 place count 442 transition count 1270
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 240 place count 424 transition count 1252
Applied a total of 240 rules in 226 ms. Remains 424 /544 variables (removed 120) and now considering 1252/1372 (removed 120) transitions.
Running 1248 sub problems to find dead transitions.
[2024-05-27 22:34:23] [INFO ] Flow matrix only has 1228 transitions (discarded 24 similar events)
// Phase 1: matrix 1228 rows 424 cols
[2024-05-27 22:34:23] [INFO ] Computed 40 invariants in 49 ms
[2024-05-27 22:34:23] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
[2024-05-27 22:34:37] [INFO ] Deduced a trap composed of 56 places in 110 ms of which 2 ms to minimize.
[2024-05-27 22:34:37] [INFO ] Deduced a trap composed of 56 places in 95 ms of which 1 ms to minimize.
[2024-05-27 22:34:37] [INFO ] Deduced a trap composed of 56 places in 56 ms of which 1 ms to minimize.
[2024-05-27 22:34:38] [INFO ] Deduced a trap composed of 56 places in 77 ms of which 0 ms to minimize.
[2024-05-27 22:34:38] [INFO ] Deduced a trap composed of 56 places in 77 ms of which 1 ms to minimize.
[2024-05-27 22:34:38] [INFO ] Deduced a trap composed of 56 places in 76 ms of which 1 ms to minimize.
[2024-05-27 22:34:38] [INFO ] Deduced a trap composed of 194 places in 347 ms of which 3 ms to minimize.
[2024-05-27 22:34:39] [INFO ] Deduced a trap composed of 197 places in 316 ms of which 3 ms to minimize.
[2024-05-27 22:34:39] [INFO ] Deduced a trap composed of 209 places in 314 ms of which 2 ms to minimize.
[2024-05-27 22:34:41] [INFO ] Deduced a trap composed of 178 places in 236 ms of which 3 ms to minimize.
[2024-05-27 22:34:41] [INFO ] Deduced a trap composed of 232 places in 284 ms of which 4 ms to minimize.
[2024-05-27 22:34:49] [INFO ] Deduced a trap composed of 115 places in 323 ms of which 3 ms to minimize.
SMT process timed out in 26109ms, After SMT, problems are : Problem set: 0 solved, 1248 unsolved
Search for dead transitions found 0 dead transitions in 26139ms
[2024-05-27 22:34:49] [INFO ] Flow matrix only has 1228 transitions (discarded 24 similar events)
[2024-05-27 22:34:49] [INFO ] Invariant cache hit.
[2024-05-27 22:34:50] [INFO ] Implicit Places using invariants in 1295 ms returned []
[2024-05-27 22:34:50] [INFO ] Flow matrix only has 1228 transitions (discarded 24 similar events)
[2024-05-27 22:34:50] [INFO ] Invariant cache hit.
[2024-05-27 22:34:51] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:34:55] [INFO ] Implicit Places using invariants and state equation in 4822 ms returned []
Implicit Place search using SMT with State Equation took 6140 ms to find 0 implicit places.
[2024-05-27 22:34:55] [INFO ] Redundant transitions in 80 ms returned []
Running 1248 sub problems to find dead transitions.
[2024-05-27 22:34:55] [INFO ] Flow matrix only has 1228 transitions (discarded 24 similar events)
[2024-05-27 22:34:55] [INFO ] Invariant cache hit.
[2024-05-27 22:34:55] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
[2024-05-27 22:35:17] [INFO ] Deduced a trap composed of 56 places in 82 ms of which 1 ms to minimize.
[2024-05-27 22:35:17] [INFO ] Deduced a trap composed of 56 places in 109 ms of which 1 ms to minimize.
[2024-05-27 22:35:17] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 1 ms to minimize.
[2024-05-27 22:35:18] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 1 ms to minimize.
[2024-05-27 22:35:18] [INFO ] Deduced a trap composed of 56 places in 92 ms of which 1 ms to minimize.
[2024-05-27 22:35:18] [INFO ] Deduced a trap composed of 56 places in 88 ms of which 1 ms to minimize.
[2024-05-27 22:35:25] [INFO ] Deduced a trap composed of 190 places in 358 ms of which 4 ms to minimize.
[2024-05-27 22:35:26] [INFO ] Deduced a trap composed of 40 places in 230 ms of which 2 ms to minimize.
[2024-05-27 22:35:27] [INFO ] Deduced a trap composed of 171 places in 316 ms of which 3 ms to minimize.
[2024-05-27 22:35:27] [INFO ] Deduced a trap composed of 198 places in 306 ms of which 3 ms to minimize.
[2024-05-27 22:35:29] [INFO ] Deduced a trap composed of 74 places in 327 ms of which 7 ms to minimize.
[2024-05-27 22:35:29] [INFO ] Deduced a trap composed of 99 places in 260 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 420/1652 variables, and 48 constraints, problems are : Problem set: 0 solved, 1248 unsolved in 30086 ms.
Refiners :[Positive P Invariants (semi-flows): 11/15 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/424 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1248/1248 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1248 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
[2024-05-27 22:35:35] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 2 ms to minimize.
[2024-05-27 22:35:46] [INFO ] Deduced a trap composed of 168 places in 312 ms of which 4 ms to minimize.
[2024-05-27 22:35:47] [INFO ] Deduced a trap composed of 189 places in 282 ms of which 4 ms to minimize.
[2024-05-27 22:35:52] [INFO ] Deduced a trap composed of 217 places in 504 ms of which 3 ms to minimize.
[2024-05-27 22:35:52] [INFO ] Deduced a trap composed of 235 places in 311 ms of which 2 ms to minimize.
[2024-05-27 22:35:53] [INFO ] Deduced a trap composed of 230 places in 386 ms of which 3 ms to minimize.
[2024-05-27 22:35:53] [INFO ] Deduced a trap composed of 222 places in 422 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/1652 variables, and 55 constraints, problems are : Problem set: 0 solved, 1248 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 11/15 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/424 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1248 constraints, Known Traps: 19/19 constraints]
After SMT, in 66336ms problems are : Problem set: 0 solved, 1248 unsolved
Search for dead transitions found 0 dead transitions in 66382ms
Starting structural reductions in SI_LTL mode, iteration 1 : 424/544 places, 1252/1372 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 99017 ms. Remains : 424/544 places, 1252/1372 transitions.
Stuttering acceptance computed with spot in 499 ms :[(AND (NOT p0) (NOT p3)), (NOT p1), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PolyORBLF-COL-S04J04T06-LTLFireability-00
Product exploration explored 100000 steps with 1353 reset in 799 ms.
Product exploration explored 100000 steps with 1348 reset in 922 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p3) (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p3) (NOT p2) (NOT p1))), (X (NOT p3)), (X (AND p0 (NOT p3) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (AND (NOT p3) (NOT p2))), (X (AND p0 (NOT p2))), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (AND p0 (NOT p3) (NOT p2))), (X (AND p0 (NOT p3))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT p3))), (X (X (AND p0 (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (AND p0 (NOT p2)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND p0 (NOT p3) (NOT p2)))), (X (X (AND p0 (NOT p3)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 39 factoid took 454 ms. Reduced automaton from 6 states, 18 edges and 4 AP (stutter insensitive) to 6 states, 18 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 449 ms :[(AND (NOT p0) (NOT p3)), (NOT p1), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 362 steps (0 resets) in 40 ms. (8 steps per ms) remains 0/19 properties
Knowledge obtained : [(AND p0 (NOT p3) (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p3) (NOT p2) (NOT p1))), (X (NOT p3)), (X (AND p0 (NOT p3) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (AND (NOT p3) (NOT p2))), (X (AND p0 (NOT p2))), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (AND p0 (NOT p3) (NOT p2))), (X (AND p0 (NOT p3))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT p3))), (X (X (AND p0 (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (AND p0 (NOT p2)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND p0 (NOT p3) (NOT p2)))), (X (X (AND p0 (NOT p3)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (F (NOT (AND p0 (NOT p2)))), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (NOT (AND p0 (NOT p3)))), (F (NOT (OR p0 p3))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p3)))), (F (NOT (OR p0 p1 p2))), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p1) (NOT p2)))), (F p2), (F p1), (F (NOT (OR p0 p1 p2 p3))), (F (NOT (OR p0 p2))), (F (NOT p0)), (F p3), (F (NOT (AND p0 (NOT p2) (NOT p3)))), (F (NOT (OR p0 p2 p3)))]
Knowledge based reduction with 39 factoid took 1194 ms. Reduced automaton from 6 states, 18 edges and 4 AP (stutter insensitive) to 6 states, 18 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 364 ms :[(AND (NOT p0) (NOT p3)), (NOT p1), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 392 ms :[(AND (NOT p0) (NOT p3)), (NOT p1), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2))]
Support contains 52 out of 424 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 424/424 places, 1252/1252 transitions.
Applied a total of 0 rules in 75 ms. Remains 424 /424 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
Running 1248 sub problems to find dead transitions.
[2024-05-27 22:36:07] [INFO ] Flow matrix only has 1228 transitions (discarded 24 similar events)
[2024-05-27 22:36:07] [INFO ] Invariant cache hit.
[2024-05-27 22:36:07] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 420/1652 variables, and 36 constraints, problems are : Problem set: 0 solved, 1248 unsolved in 20084 ms.
Refiners :[Positive P Invariants (semi-flows): 11/15 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/424 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1248/1248 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1248 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
[2024-05-27 22:36:33] [INFO ] Deduced a trap composed of 56 places in 134 ms of which 2 ms to minimize.
[2024-05-27 22:36:33] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 2 ms to minimize.
[2024-05-27 22:36:33] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 2 ms to minimize.
[2024-05-27 22:36:33] [INFO ] Deduced a trap composed of 56 places in 88 ms of which 2 ms to minimize.
[2024-05-27 22:36:34] [INFO ] Deduced a trap composed of 20 places in 165 ms of which 1 ms to minimize.
[2024-05-27 22:36:34] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 1 ms to minimize.
[2024-05-27 22:36:36] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 1 ms to minimize.
[2024-05-27 22:36:37] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 2 ms to minimize.
[2024-05-27 22:36:43] [INFO ] Deduced a trap composed of 168 places in 331 ms of which 3 ms to minimize.
[2024-05-27 22:36:44] [INFO ] Deduced a trap composed of 192 places in 284 ms of which 3 ms to minimize.
[2024-05-27 22:36:44] [INFO ] Deduced a trap composed of 190 places in 274 ms of which 4 ms to minimize.
[2024-05-27 22:36:45] [INFO ] Deduced a trap composed of 231 places in 345 ms of which 6 ms to minimize.
[2024-05-27 22:36:45] [INFO ] Deduced a trap composed of 177 places in 302 ms of which 3 ms to minimize.
[2024-05-27 22:36:46] [INFO ] Deduced a trap composed of 80 places in 265 ms of which 15 ms to minimize.
[2024-05-27 22:36:47] [INFO ] Deduced a trap composed of 101 places in 281 ms of which 4 ms to minimize.
[2024-05-27 22:36:51] [INFO ] Deduced a trap composed of 212 places in 373 ms of which 3 ms to minimize.
[2024-05-27 22:36:51] [INFO ] Deduced a trap composed of 225 places in 266 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/1652 variables, and 53 constraints, problems are : Problem set: 0 solved, 1248 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 11/15 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/424 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1248 constraints, Known Traps: 17/17 constraints]
After SMT, in 44849ms problems are : Problem set: 0 solved, 1248 unsolved
Search for dead transitions found 0 dead transitions in 44873ms
[2024-05-27 22:36:52] [INFO ] Flow matrix only has 1228 transitions (discarded 24 similar events)
[2024-05-27 22:36:52] [INFO ] Invariant cache hit.
[2024-05-27 22:36:52] [INFO ] Implicit Places using invariants in 393 ms returned []
[2024-05-27 22:36:52] [INFO ] Flow matrix only has 1228 transitions (discarded 24 similar events)
[2024-05-27 22:36:52] [INFO ] Invariant cache hit.
[2024-05-27 22:36:53] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:36:57] [INFO ] Implicit Places using invariants and state equation in 4630 ms returned []
Implicit Place search using SMT with State Equation took 5026 ms to find 0 implicit places.
[2024-05-27 22:36:57] [INFO ] Redundant transitions in 85 ms returned []
Running 1248 sub problems to find dead transitions.
[2024-05-27 22:36:57] [INFO ] Flow matrix only has 1228 transitions (discarded 24 similar events)
[2024-05-27 22:36:57] [INFO ] Invariant cache hit.
[2024-05-27 22:36:57] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
[2024-05-27 22:37:11] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 1 ms to minimize.
[2024-05-27 22:37:11] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 1 ms to minimize.
[2024-05-27 22:37:12] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 1 ms to minimize.
[2024-05-27 22:37:12] [INFO ] Deduced a trap composed of 56 places in 96 ms of which 27 ms to minimize.
[2024-05-27 22:37:12] [INFO ] Deduced a trap composed of 56 places in 77 ms of which 1 ms to minimize.
[2024-05-27 22:37:12] [INFO ] Deduced a trap composed of 56 places in 53 ms of which 1 ms to minimize.
[2024-05-27 22:37:20] [INFO ] Deduced a trap composed of 190 places in 383 ms of which 4 ms to minimize.
[2024-05-27 22:37:21] [INFO ] Deduced a trap composed of 40 places in 194 ms of which 2 ms to minimize.
[2024-05-27 22:37:22] [INFO ] Deduced a trap composed of 171 places in 422 ms of which 3 ms to minimize.
[2024-05-27 22:37:22] [INFO ] Deduced a trap composed of 198 places in 485 ms of which 20 ms to minimize.
[2024-05-27 22:37:23] [INFO ] Deduced a trap composed of 74 places in 363 ms of which 3 ms to minimize.
[2024-05-27 22:37:24] [INFO ] Deduced a trap composed of 99 places in 351 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
[2024-05-27 22:37:29] [INFO ] Deduced a trap composed of 180 places in 304 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 420/1652 variables, and 49 constraints, problems are : Problem set: 0 solved, 1248 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 11/15 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/424 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1248/1248 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1248 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
[2024-05-27 22:37:36] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 1 ms to minimize.
[2024-05-27 22:37:38] [INFO ] Deduced a trap composed of 181 places in 349 ms of which 4 ms to minimize.
[2024-05-27 22:37:39] [INFO ] Deduced a trap composed of 174 places in 443 ms of which 6 ms to minimize.
[2024-05-27 22:37:39] [INFO ] Deduced a trap composed of 254 places in 330 ms of which 3 ms to minimize.
[2024-05-27 22:37:40] [INFO ] Deduced a trap composed of 232 places in 281 ms of which 3 ms to minimize.
[2024-05-27 22:37:48] [INFO ] Deduced a trap composed of 168 places in 300 ms of which 5 ms to minimize.
[2024-05-27 22:37:50] [INFO ] Deduced a trap composed of 184 places in 387 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/1652 variables, and 56 constraints, problems are : Problem set: 0 solved, 1248 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 11/15 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/424 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1248 constraints, Known Traps: 20/20 constraints]
After SMT, in 65927ms problems are : Problem set: 0 solved, 1248 unsolved
Search for dead transitions found 0 dead transitions in 65949ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 116033 ms. Remains : 424/424 places, 1252/1252 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p3) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 (NOT p2))), (X (AND p0 (NOT p1) (NOT p2) (NOT p3))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (AND p0 (NOT p2) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p2) (NOT p3))), (X (AND (NOT p1) (NOT p2) (NOT p3))), (X (AND p0 (NOT p3))), (X p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (AND p0 (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (AND p0 (NOT p3)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 39 factoid took 226 ms. Reduced automaton from 6 states, 18 edges and 4 AP (stutter insensitive) to 6 states, 18 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 352 ms :[(AND (NOT p0) (NOT p3)), (NOT p1), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 319 steps (0 resets) in 22 ms. (13 steps per ms) remains 0/19 properties
Knowledge obtained : [(AND p0 (NOT p3) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 (NOT p2))), (X (AND p0 (NOT p1) (NOT p2) (NOT p3))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (AND p0 (NOT p2) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p2) (NOT p3))), (X (AND (NOT p1) (NOT p2) (NOT p3))), (X (AND p0 (NOT p3))), (X p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (AND p0 (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (AND p0 (NOT p3)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p3) (NOT p1)))), (F (NOT (AND p0 (NOT p2) (NOT p1)))), (F (NOT (AND p0 (NOT p2) (NOT p3) (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (OR p0 p3))), (F (NOT (AND (NOT p2) (NOT p3)))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p2)))), (F (NOT (AND p0 (NOT p2) (NOT p3)))), (F (NOT (OR p0 p2 p3 p1))), (F p2), (F p1), (F (NOT p0)), (F (NOT (OR p0 p2))), (F (NOT (AND p0 (NOT p3)))), (F p3), (F (NOT (OR p0 p2 p3))), (F (NOT (OR p0 p2 p1)))]
Knowledge based reduction with 39 factoid took 1161 ms. Reduced automaton from 6 states, 18 edges and 4 AP (stutter insensitive) to 6 states, 18 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 399 ms :[(AND (NOT p0) (NOT p3)), (NOT p1), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 417 ms :[(AND (NOT p0) (NOT p3)), (NOT p1), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 510 ms :[(AND (NOT p0) (NOT p3)), (NOT p1), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 1347 reset in 702 ms.
Product exploration explored 100000 steps with 1351 reset in 589 ms.
Support contains 52 out of 424 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 424/424 places, 1252/1252 transitions.
Applied a total of 0 rules in 34 ms. Remains 424 /424 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
Running 1248 sub problems to find dead transitions.
[2024-05-27 22:38:07] [INFO ] Flow matrix only has 1228 transitions (discarded 24 similar events)
[2024-05-27 22:38:07] [INFO ] Invariant cache hit.
[2024-05-27 22:38:07] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
[2024-05-27 22:38:23] [INFO ] Deduced a trap composed of 56 places in 85 ms of which 1 ms to minimize.
[2024-05-27 22:38:23] [INFO ] Deduced a trap composed of 56 places in 88 ms of which 0 ms to minimize.
[2024-05-27 22:38:24] [INFO ] Deduced a trap composed of 56 places in 87 ms of which 1 ms to minimize.
[2024-05-27 22:38:24] [INFO ] Deduced a trap composed of 56 places in 89 ms of which 1 ms to minimize.
[2024-05-27 22:38:24] [INFO ] Deduced a trap composed of 56 places in 90 ms of which 1 ms to minimize.
[2024-05-27 22:38:24] [INFO ] Deduced a trap composed of 56 places in 83 ms of which 1 ms to minimize.
[2024-05-27 22:38:32] [INFO ] Deduced a trap composed of 190 places in 302 ms of which 3 ms to minimize.
[2024-05-27 22:38:32] [INFO ] Deduced a trap composed of 40 places in 191 ms of which 1 ms to minimize.
[2024-05-27 22:38:33] [INFO ] Deduced a trap composed of 171 places in 355 ms of which 4 ms to minimize.
SMT process timed out in 26129ms, After SMT, problems are : Problem set: 0 solved, 1248 unsolved
Search for dead transitions found 0 dead transitions in 26151ms
[2024-05-27 22:38:33] [INFO ] Flow matrix only has 1228 transitions (discarded 24 similar events)
[2024-05-27 22:38:33] [INFO ] Invariant cache hit.
[2024-05-27 22:38:34] [INFO ] Implicit Places using invariants in 420 ms returned []
[2024-05-27 22:38:34] [INFO ] Flow matrix only has 1228 transitions (discarded 24 similar events)
[2024-05-27 22:38:34] [INFO ] Invariant cache hit.
[2024-05-27 22:38:38] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:38:48] [INFO ] Implicit Places using invariants and state equation in 14628 ms returned []
Implicit Place search using SMT with State Equation took 15056 ms to find 0 implicit places.
[2024-05-27 22:38:48] [INFO ] Redundant transitions in 32 ms returned []
Running 1248 sub problems to find dead transitions.
[2024-05-27 22:38:48] [INFO ] Flow matrix only has 1228 transitions (discarded 24 similar events)
[2024-05-27 22:38:48] [INFO ] Invariant cache hit.
[2024-05-27 22:38:48] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
[2024-05-27 22:39:03] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 1 ms to minimize.
[2024-05-27 22:39:03] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 1 ms to minimize.
[2024-05-27 22:39:03] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 1 ms to minimize.
[2024-05-27 22:39:03] [INFO ] Deduced a trap composed of 56 places in 54 ms of which 1 ms to minimize.
[2024-05-27 22:39:03] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
[2024-05-27 22:39:03] [INFO ] Deduced a trap composed of 56 places in 87 ms of which 1 ms to minimize.
[2024-05-27 22:39:11] [INFO ] Deduced a trap composed of 190 places in 267 ms of which 3 ms to minimize.
[2024-05-27 22:39:11] [INFO ] Deduced a trap composed of 40 places in 216 ms of which 1 ms to minimize.
[2024-05-27 22:39:13] [INFO ] Deduced a trap composed of 171 places in 376 ms of which 3 ms to minimize.
[2024-05-27 22:39:13] [INFO ] Deduced a trap composed of 198 places in 274 ms of which 3 ms to minimize.
[2024-05-27 22:39:14] [INFO ] Deduced a trap composed of 74 places in 291 ms of which 3 ms to minimize.
[2024-05-27 22:39:14] [INFO ] Deduced a trap composed of 99 places in 266 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
[2024-05-27 22:39:19] [INFO ] Deduced a trap composed of 180 places in 330 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 420/1652 variables, and 49 constraints, problems are : Problem set: 0 solved, 1248 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 11/15 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/424 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1248/1248 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1248 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
[2024-05-27 22:39:26] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 2 ms to minimize.
[2024-05-27 22:39:29] [INFO ] Deduced a trap composed of 181 places in 363 ms of which 4 ms to minimize.
[2024-05-27 22:39:29] [INFO ] Deduced a trap composed of 174 places in 370 ms of which 3 ms to minimize.
[2024-05-27 22:39:29] [INFO ] Deduced a trap composed of 254 places in 252 ms of which 2 ms to minimize.
[2024-05-27 22:39:30] [INFO ] Deduced a trap composed of 232 places in 286 ms of which 3 ms to minimize.
[2024-05-27 22:39:38] [INFO ] Deduced a trap composed of 168 places in 295 ms of which 3 ms to minimize.
[2024-05-27 22:39:39] [INFO ] Deduced a trap composed of 184 places in 326 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/1652 variables, and 56 constraints, problems are : Problem set: 0 solved, 1248 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 11/15 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/424 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1248 constraints, Known Traps: 20/20 constraints]
After SMT, in 65742ms problems are : Problem set: 0 solved, 1248 unsolved
Search for dead transitions found 0 dead transitions in 65762ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 107061 ms. Remains : 424/424 places, 1252/1252 transitions.
Treatment of property PolyORBLF-COL-S04J04T06-LTLFireability-00 finished in 332145 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 544 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 544/544 places, 1372/1372 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 544 transition count 1318
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 490 transition count 1318
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 108 place count 490 transition count 1258
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 228 place count 430 transition count 1258
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 234 place count 424 transition count 1252
Iterating global reduction 2 with 6 rules applied. Total rules applied 240 place count 424 transition count 1252
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 360 place count 364 transition count 1192
Applied a total of 360 rules in 86 ms. Remains 364 /544 variables (removed 180) and now considering 1192/1372 (removed 180) transitions.
Running 1188 sub problems to find dead transitions.
[2024-05-27 22:39:54] [INFO ] Flow matrix only has 1168 transitions (discarded 24 similar events)
// Phase 1: matrix 1168 rows 364 cols
[2024-05-27 22:39:54] [INFO ] Computed 40 invariants in 26 ms
[2024-05-27 22:39:55] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
[2024-05-27 22:40:07] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 1 ms to minimize.
[2024-05-27 22:40:07] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 1 ms to minimize.
[2024-05-27 22:40:07] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 1 ms to minimize.
[2024-05-27 22:40:07] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 1 ms to minimize.
[2024-05-27 22:40:07] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 1 ms to minimize.
[2024-05-27 22:40:08] [INFO ] Deduced a trap composed of 155 places in 299 ms of which 3 ms to minimize.
[2024-05-27 22:40:08] [INFO ] Deduced a trap composed of 165 places in 330 ms of which 3 ms to minimize.
[2024-05-27 22:40:08] [INFO ] Deduced a trap composed of 209 places in 305 ms of which 3 ms to minimize.
[2024-05-27 22:40:09] [INFO ] Deduced a trap composed of 151 places in 274 ms of which 2 ms to minimize.
[2024-05-27 22:40:09] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 1 ms to minimize.
[2024-05-27 22:40:10] [INFO ] Deduced a trap composed of 178 places in 247 ms of which 3 ms to minimize.
[2024-05-27 22:40:11] [INFO ] Deduced a trap composed of 170 places in 364 ms of which 4 ms to minimize.
[2024-05-27 22:40:11] [INFO ] Deduced a trap composed of 15 places in 371 ms of which 3 ms to minimize.
[2024-05-27 22:40:17] [INFO ] Deduced a trap composed of 45 places in 238 ms of which 15 ms to minimize.
[2024-05-27 22:40:20] [INFO ] Deduced a trap composed of 92 places in 262 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 360/1532 variables, and 51 constraints, problems are : Problem set: 0 solved, 1188 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 25/28 constraints, State Equation: 0/364 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1188/1188 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
[2024-05-27 22:40:24] [INFO ] Deduced a trap composed of 57 places in 281 ms of which 3 ms to minimize.
[2024-05-27 22:40:34] [INFO ] Deduced a trap composed of 120 places in 257 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 360/1532 variables, and 53 constraints, problems are : Problem set: 0 solved, 1188 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 25/28 constraints, State Equation: 0/364 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1188 constraints, Known Traps: 17/17 constraints]
After SMT, in 45682ms problems are : Problem set: 0 solved, 1188 unsolved
Search for dead transitions found 0 dead transitions in 45701ms
[2024-05-27 22:40:40] [INFO ] Flow matrix only has 1168 transitions (discarded 24 similar events)
[2024-05-27 22:40:40] [INFO ] Invariant cache hit.
[2024-05-27 22:40:40] [INFO ] Implicit Places using invariants in 322 ms returned []
[2024-05-27 22:40:40] [INFO ] Flow matrix only has 1168 transitions (discarded 24 similar events)
[2024-05-27 22:40:40] [INFO ] Invariant cache hit.
[2024-05-27 22:40:41] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:40:56] [INFO ] Implicit Places using invariants and state equation in 15646 ms returned []
Implicit Place search using SMT with State Equation took 15971 ms to find 0 implicit places.
[2024-05-27 22:40:56] [INFO ] Redundant transitions in 10 ms returned []
Running 1188 sub problems to find dead transitions.
[2024-05-27 22:40:56] [INFO ] Flow matrix only has 1168 transitions (discarded 24 similar events)
[2024-05-27 22:40:56] [INFO ] Invariant cache hit.
[2024-05-27 22:40:56] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
[2024-05-27 22:41:09] [INFO ] Deduced a trap composed of 46 places in 59 ms of which 1 ms to minimize.
[2024-05-27 22:41:09] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 1 ms to minimize.
[2024-05-27 22:41:09] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 1 ms to minimize.
[2024-05-27 22:41:09] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 1 ms to minimize.
[2024-05-27 22:41:09] [INFO ] Deduced a trap composed of 46 places in 63 ms of which 1 ms to minimize.
[2024-05-27 22:41:10] [INFO ] Deduced a trap composed of 168 places in 319 ms of which 2 ms to minimize.
[2024-05-27 22:41:10] [INFO ] Deduced a trap composed of 177 places in 313 ms of which 3 ms to minimize.
[2024-05-27 22:41:11] [INFO ] Deduced a trap composed of 183 places in 432 ms of which 3 ms to minimize.
[2024-05-27 22:41:11] [INFO ] Deduced a trap composed of 156 places in 252 ms of which 2 ms to minimize.
[2024-05-27 22:41:11] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 1 ms to minimize.
[2024-05-27 22:41:12] [INFO ] Deduced a trap composed of 138 places in 257 ms of which 2 ms to minimize.
[2024-05-27 22:41:20] [INFO ] Deduced a trap composed of 145 places in 274 ms of which 3 ms to minimize.
[2024-05-27 22:41:21] [INFO ] Deduced a trap composed of 103 places in 264 ms of which 3 ms to minimize.
[2024-05-27 22:41:22] [INFO ] Deduced a trap composed of 153 places in 414 ms of which 2 ms to minimize.
[2024-05-27 22:41:22] [INFO ] Deduced a trap composed of 3 places in 320 ms of which 2 ms to minimize.
[2024-05-27 22:41:23] [INFO ] Deduced a trap composed of 15 places in 241 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
[2024-05-27 22:41:25] [INFO ] Deduced a trap composed of 178 places in 317 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 360/1532 variables, and 53 constraints, problems are : Problem set: 0 solved, 1188 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 25/28 constraints, State Equation: 0/364 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1188/1188 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/361 variables, 1/54 constraints. Problems are: Problem set: 90 solved, 1098 unsolved
[2024-05-27 22:42:01] [INFO ] Deduced a trap composed of 120 places in 241 ms of which 3 ms to minimize.
[2024-05-27 22:42:02] [INFO ] Deduced a trap composed of 26 places in 211 ms of which 3 ms to minimize.
[2024-05-27 22:42:02] [INFO ] Deduced a trap composed of 57 places in 255 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 361/1532 variables, and 57 constraints, problems are : Problem set: 90 solved, 1098 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 25/28 constraints, State Equation: 0/364 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1188 constraints, Known Traps: 20/20 constraints]
After SMT, in 66120ms problems are : Problem set: 90 solved, 1098 unsolved
Search for dead transitions found 90 dead transitions in 66138ms
Found 90 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 90 transitions
Dead transitions reduction (with SMT) removed 90 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 364/544 places, 1102/1372 transitions.
Applied a total of 0 rules in 22 ms. Remains 364 /364 variables (removed 0) and now considering 1102/1102 (removed 0) transitions.
[2024-05-27 22:42:02] [INFO ] Redundant transitions in 8 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 127968 ms. Remains : 364/544 places, 1102/1372 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J04T06-LTLFireability-02
Product exploration explored 100000 steps with 3062 reset in 512 ms.
Product exploration explored 100000 steps with 3100 reset in 652 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 123 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 85 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 147 steps (0 resets) in 6 ms. (21 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 126 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 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
[2024-05-27 22:42:04] [INFO ] Flow matrix only has 1078 transitions (discarded 24 similar events)
// Phase 1: matrix 1078 rows 364 cols
[2024-05-27 22:42:04] [INFO ] Computed 40 invariants in 41 ms
[2024-05-27 22:42:05] [INFO ] [Real]Absence check using 12 positive place invariants in 10 ms returned sat
[2024-05-27 22:42:05] [INFO ] [Real]Absence check using 12 positive and 28 generalized place invariants in 140 ms returned sat
[2024-05-27 22:42:06] [INFO ] [Real]Absence check using state equation in 1013 ms returned sat
[2024-05-27 22:42:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:42:07] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-05-27 22:42:07] [INFO ] [Nat]Absence check using 12 positive and 28 generalized place invariants in 37 ms returned sat
[2024-05-27 22:42:09] [INFO ] [Nat]Absence check using state equation in 1918 ms returned sat
[2024-05-27 22:42:09] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:42:10] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 22:42:11] [INFO ] [Nat]Added 120 Read/Feed constraints in 2073 ms returned sat
[2024-05-27 22:42:11] [INFO ] Deduced a trap composed of 46 places in 290 ms of which 2 ms to minimize.
[2024-05-27 22:42:12] [INFO ] Deduced a trap composed of 45 places in 435 ms of which 2 ms to minimize.
[2024-05-27 22:42:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1737 ms
[2024-05-27 22:42:13] [INFO ] Computed and/alt/rep : 678/3031/660 causal constraints (skipped 414 transitions) in 154 ms.
[2024-05-27 22:42:15] [INFO ] Added : 80 causal constraints over 16 iterations in 2433 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 12 out of 364 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 364/364 places, 1102/1102 transitions.
Applied a total of 0 rules in 35 ms. Remains 364 /364 variables (removed 0) and now considering 1102/1102 (removed 0) transitions.
Running 1098 sub problems to find dead transitions.
[2024-05-27 22:42:15] [INFO ] Flow matrix only has 1078 transitions (discarded 24 similar events)
[2024-05-27 22:42:15] [INFO ] Invariant cache hit.
[2024-05-27 22:42:15] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-27 22:42:26] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 2 ms to minimize.
[2024-05-27 22:42:26] [INFO ] Deduced a trap composed of 46 places in 84 ms of which 1 ms to minimize.
[2024-05-27 22:42:26] [INFO ] Deduced a trap composed of 46 places in 67 ms of which 1 ms to minimize.
[2024-05-27 22:42:27] [INFO ] Deduced a trap composed of 46 places in 75 ms of which 1 ms to minimize.
[2024-05-27 22:42:27] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 1 ms to minimize.
[2024-05-27 22:42:27] [INFO ] Deduced a trap composed of 151 places in 275 ms of which 3 ms to minimize.
[2024-05-27 22:42:27] [INFO ] Deduced a trap composed of 148 places in 366 ms of which 3 ms to minimize.
[2024-05-27 22:42:28] [INFO ] Deduced a trap composed of 202 places in 292 ms of which 2 ms to minimize.
[2024-05-27 22:42:28] [INFO ] Deduced a trap composed of 156 places in 259 ms of which 2 ms to minimize.
[2024-05-27 22:42:28] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 0 ms to minimize.
[2024-05-27 22:42:29] [INFO ] Deduced a trap composed of 138 places in 219 ms of which 2 ms to minimize.
[2024-05-27 22:42:31] [INFO ] Deduced a trap composed of 183 places in 293 ms of which 3 ms to minimize.
[2024-05-27 22:42:37] [INFO ] Deduced a trap composed of 186 places in 288 ms of which 2 ms to minimize.
[2024-05-27 22:42:38] [INFO ] Deduced a trap composed of 45 places in 202 ms of which 2 ms to minimize.
[2024-05-27 22:42:38] [INFO ] Deduced a trap composed of 120 places in 260 ms of which 3 ms to minimize.
[2024-05-27 22:42:39] [INFO ] Deduced a trap composed of 104 places in 308 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 360/1442 variables, and 52 constraints, problems are : Problem set: 0 solved, 1098 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 25/28 constraints, State Equation: 0/364 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1098/1098 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1098 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-27 22:42:43] [INFO ] Deduced a trap composed of 178 places in 260 ms of which 2 ms to minimize.
[2024-05-27 22:42:43] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 2 ms to minimize.
[2024-05-27 22:42:44] [INFO ] Deduced a trap composed of 148 places in 284 ms of which 2 ms to minimize.
[2024-05-27 22:42:44] [INFO ] Deduced a trap composed of 143 places in 321 ms of which 2 ms to minimize.
[2024-05-27 22:42:53] [INFO ] Deduced a trap composed of 32 places in 385 ms of which 4 ms to minimize.
[2024-05-27 22:42:53] [INFO ] Deduced a trap composed of 57 places in 382 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 360/1442 variables, and 58 constraints, problems are : Problem set: 0 solved, 1098 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 25/28 constraints, State Equation: 0/364 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1098 constraints, Known Traps: 22/22 constraints]
After SMT, in 44689ms problems are : Problem set: 0 solved, 1098 unsolved
Search for dead transitions found 0 dead transitions in 44720ms
[2024-05-27 22:43:00] [INFO ] Flow matrix only has 1078 transitions (discarded 24 similar events)
[2024-05-27 22:43:00] [INFO ] Invariant cache hit.
[2024-05-27 22:43:00] [INFO ] Implicit Places using invariants in 396 ms returned []
[2024-05-27 22:43:00] [INFO ] Flow matrix only has 1078 transitions (discarded 24 similar events)
[2024-05-27 22:43:00] [INFO ] Invariant cache hit.
[2024-05-27 22:43:01] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:43:07] [INFO ] Implicit Places using invariants and state equation in 7026 ms returned []
Implicit Place search using SMT with State Equation took 7428 ms to find 0 implicit places.
[2024-05-27 22:43:07] [INFO ] Redundant transitions in 16 ms returned []
Running 1098 sub problems to find dead transitions.
[2024-05-27 22:43:07] [INFO ] Flow matrix only has 1078 transitions (discarded 24 similar events)
[2024-05-27 22:43:07] [INFO ] Invariant cache hit.
[2024-05-27 22:43:07] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-27 22:43:17] [INFO ] Deduced a trap composed of 46 places in 92 ms of which 2 ms to minimize.
[2024-05-27 22:43:17] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 1 ms to minimize.
[2024-05-27 22:43:17] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 1 ms to minimize.
[2024-05-27 22:43:17] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
[2024-05-27 22:43:17] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 1 ms to minimize.
[2024-05-27 22:43:17] [INFO ] Deduced a trap composed of 151 places in 260 ms of which 2 ms to minimize.
[2024-05-27 22:43:18] [INFO ] Deduced a trap composed of 148 places in 254 ms of which 2 ms to minimize.
[2024-05-27 22:43:18] [INFO ] Deduced a trap composed of 202 places in 249 ms of which 3 ms to minimize.
[2024-05-27 22:43:18] [INFO ] Deduced a trap composed of 156 places in 274 ms of which 3 ms to minimize.
[2024-05-27 22:43:19] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 1 ms to minimize.
[2024-05-27 22:43:19] [INFO ] Deduced a trap composed of 138 places in 301 ms of which 3 ms to minimize.
[2024-05-27 22:43:22] [INFO ] Deduced a trap composed of 183 places in 280 ms of which 2 ms to minimize.
[2024-05-27 22:43:28] [INFO ] Deduced a trap composed of 186 places in 279 ms of which 2 ms to minimize.
[2024-05-27 22:43:29] [INFO ] Deduced a trap composed of 45 places in 182 ms of which 2 ms to minimize.
[2024-05-27 22:43:29] [INFO ] Deduced a trap composed of 120 places in 244 ms of which 2 ms to minimize.
[2024-05-27 22:43:30] [INFO ] Deduced a trap composed of 104 places in 300 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-27 22:43:31] [INFO ] Deduced a trap composed of 144 places in 229 ms of which 2 ms to minimize.
[2024-05-27 22:43:32] [INFO ] Deduced a trap composed of 132 places in 466 ms of which 3 ms to minimize.
[2024-05-27 22:43:32] [INFO ] Deduced a trap composed of 15 places in 418 ms of which 2 ms to minimize.
[2024-05-27 22:43:34] [INFO ] Deduced a trap composed of 178 places in 210 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 360/1442 variables, and 56 constraints, problems are : Problem set: 0 solved, 1098 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 25/28 constraints, State Equation: 0/364 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1098/1098 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1098 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-27 22:43:46] [INFO ] Deduced a trap composed of 182 places in 355 ms of which 4 ms to minimize.
[2024-05-27 22:43:46] [INFO ] Deduced a trap composed of 191 places in 285 ms of which 2 ms to minimize.
[2024-05-27 22:43:47] [INFO ] Deduced a trap composed of 191 places in 431 ms of which 2 ms to minimize.
[2024-05-27 22:43:47] [INFO ] Deduced a trap composed of 200 places in 300 ms of which 3 ms to minimize.
[2024-05-27 22:43:47] [INFO ] Deduced a trap composed of 182 places in 293 ms of which 2 ms to minimize.
[2024-05-27 22:43:48] [INFO ] Deduced a trap composed of 182 places in 299 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-27 22:44:06] [INFO ] Deduced a trap composed of 182 places in 288 ms of which 3 ms to minimize.
[2024-05-27 22:44:06] [INFO ] Deduced a trap composed of 191 places in 301 ms of which 3 ms to minimize.
[2024-05-27 22:44:06] [INFO ] Deduced a trap composed of 177 places in 269 ms of which 2 ms to minimize.
[2024-05-27 22:44:07] [INFO ] Deduced a trap composed of 189 places in 292 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 360/1442 variables, and 66 constraints, problems are : Problem set: 0 solved, 1098 unsolved in 30068 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 25/28 constraints, State Equation: 0/364 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1098 constraints, Known Traps: 30/30 constraints]
After SMT, in 63849ms problems are : Problem set: 0 solved, 1098 unsolved
Search for dead transitions found 0 dead transitions in 63871ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 116102 ms. Remains : 364/364 places, 1102/1102 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 123 steps (0 resets) in 6 ms. (17 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 176 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 107 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
[2024-05-27 22:44:12] [INFO ] Flow matrix only has 1078 transitions (discarded 24 similar events)
[2024-05-27 22:44:12] [INFO ] Invariant cache hit.
[2024-05-27 22:44:13] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-27 22:44:13] [INFO ] [Real]Absence check using 12 positive and 28 generalized place invariants in 163 ms returned sat
[2024-05-27 22:44:14] [INFO ] [Real]Absence check using state equation in 1410 ms returned sat
[2024-05-27 22:44:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:44:15] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-27 22:44:15] [INFO ] [Nat]Absence check using 12 positive and 28 generalized place invariants in 55 ms returned sat
[2024-05-27 22:44:16] [INFO ] [Nat]Absence check using state equation in 841 ms returned sat
[2024-05-27 22:44:16] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:44:16] [INFO ] [Nat]Added 120 Read/Feed constraints in 134 ms returned sat
[2024-05-27 22:44:16] [INFO ] Deduced a trap composed of 26 places in 303 ms of which 3 ms to minimize.
[2024-05-27 22:44:17] [INFO ] Deduced a trap composed of 27 places in 333 ms of which 2 ms to minimize.
[2024-05-27 22:44:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 861 ms
[2024-05-27 22:44:17] [INFO ] Computed and/alt/rep : 678/3031/660 causal constraints (skipped 414 transitions) in 128 ms.
[2024-05-27 22:44:20] [INFO ] Added : 135 causal constraints over 27 iterations in 3389 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3053 reset in 612 ms.
Product exploration explored 100000 steps with 3079 reset in 693 ms.
Support contains 12 out of 364 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 364/364 places, 1102/1102 transitions.
Applied a total of 0 rules in 24 ms. Remains 364 /364 variables (removed 0) and now considering 1102/1102 (removed 0) transitions.
Running 1098 sub problems to find dead transitions.
[2024-05-27 22:44:22] [INFO ] Flow matrix only has 1078 transitions (discarded 24 similar events)
[2024-05-27 22:44:22] [INFO ] Invariant cache hit.
[2024-05-27 22:44:22] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-27 22:44:32] [INFO ] Deduced a trap composed of 46 places in 94 ms of which 1 ms to minimize.
[2024-05-27 22:44:32] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 1 ms to minimize.
[2024-05-27 22:44:32] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 1 ms to minimize.
[2024-05-27 22:44:32] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 1 ms to minimize.
[2024-05-27 22:44:32] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 1 ms to minimize.
[2024-05-27 22:44:32] [INFO ] Deduced a trap composed of 151 places in 293 ms of which 3 ms to minimize.
[2024-05-27 22:44:33] [INFO ] Deduced a trap composed of 148 places in 297 ms of which 3 ms to minimize.
[2024-05-27 22:44:33] [INFO ] Deduced a trap composed of 202 places in 287 ms of which 3 ms to minimize.
[2024-05-27 22:44:33] [INFO ] Deduced a trap composed of 156 places in 287 ms of which 3 ms to minimize.
[2024-05-27 22:44:34] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 1 ms to minimize.
[2024-05-27 22:44:34] [INFO ] Deduced a trap composed of 138 places in 324 ms of which 3 ms to minimize.
[2024-05-27 22:44:36] [INFO ] Deduced a trap composed of 183 places in 232 ms of which 2 ms to minimize.
[2024-05-27 22:44:42] [INFO ] Deduced a trap composed of 186 places in 303 ms of which 2 ms to minimize.
[2024-05-27 22:44:44] [INFO ] Deduced a trap composed of 45 places in 142 ms of which 1 ms to minimize.
[2024-05-27 22:44:44] [INFO ] Deduced a trap composed of 120 places in 282 ms of which 3 ms to minimize.
[2024-05-27 22:44:45] [INFO ] Deduced a trap composed of 104 places in 208 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 360/1442 variables, and 52 constraints, problems are : Problem set: 0 solved, 1098 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 25/28 constraints, State Equation: 0/364 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1098/1098 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1098 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-27 22:44:49] [INFO ] Deduced a trap composed of 178 places in 305 ms of which 3 ms to minimize.
[2024-05-27 22:44:49] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 1 ms to minimize.
[2024-05-27 22:44:50] [INFO ] Deduced a trap composed of 148 places in 317 ms of which 2 ms to minimize.
[2024-05-27 22:44:50] [INFO ] Deduced a trap composed of 143 places in 314 ms of which 6 ms to minimize.
[2024-05-27 22:44:58] [INFO ] Deduced a trap composed of 32 places in 292 ms of which 3 ms to minimize.
[2024-05-27 22:44:59] [INFO ] Deduced a trap composed of 57 places in 245 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 360/1442 variables, and 58 constraints, problems are : Problem set: 0 solved, 1098 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 25/28 constraints, State Equation: 0/364 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1098 constraints, Known Traps: 22/22 constraints]
After SMT, in 44242ms problems are : Problem set: 0 solved, 1098 unsolved
Search for dead transitions found 0 dead transitions in 44258ms
[2024-05-27 22:45:06] [INFO ] Flow matrix only has 1078 transitions (discarded 24 similar events)
[2024-05-27 22:45:06] [INFO ] Invariant cache hit.
[2024-05-27 22:45:06] [INFO ] Implicit Places using invariants in 415 ms returned []
[2024-05-27 22:45:06] [INFO ] Flow matrix only has 1078 transitions (discarded 24 similar events)
[2024-05-27 22:45:06] [INFO ] Invariant cache hit.
[2024-05-27 22:45:07] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:45:13] [INFO ] Implicit Places using invariants and state equation in 7289 ms returned []
Implicit Place search using SMT with State Equation took 7717 ms to find 0 implicit places.
[2024-05-27 22:45:14] [INFO ] Redundant transitions in 12 ms returned []
Running 1098 sub problems to find dead transitions.
[2024-05-27 22:45:14] [INFO ] Flow matrix only has 1078 transitions (discarded 24 similar events)
[2024-05-27 22:45:14] [INFO ] Invariant cache hit.
[2024-05-27 22:45:14] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-27 22:45:24] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 1 ms to minimize.
[2024-05-27 22:45:24] [INFO ] Deduced a trap composed of 46 places in 63 ms of which 1 ms to minimize.
[2024-05-27 22:45:24] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 1 ms to minimize.
[2024-05-27 22:45:24] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 1 ms to minimize.
[2024-05-27 22:45:24] [INFO ] Deduced a trap composed of 46 places in 59 ms of which 1 ms to minimize.
[2024-05-27 22:45:25] [INFO ] Deduced a trap composed of 151 places in 256 ms of which 2 ms to minimize.
[2024-05-27 22:45:25] [INFO ] Deduced a trap composed of 148 places in 436 ms of which 3 ms to minimize.
[2024-05-27 22:45:25] [INFO ] Deduced a trap composed of 202 places in 288 ms of which 4 ms to minimize.
[2024-05-27 22:45:26] [INFO ] Deduced a trap composed of 156 places in 321 ms of which 2 ms to minimize.
[2024-05-27 22:45:26] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 1 ms to minimize.
[2024-05-27 22:45:27] [INFO ] Deduced a trap composed of 138 places in 251 ms of which 3 ms to minimize.
[2024-05-27 22:45:29] [INFO ] Deduced a trap composed of 183 places in 238 ms of which 2 ms to minimize.
[2024-05-27 22:45:34] [INFO ] Deduced a trap composed of 186 places in 292 ms of which 2 ms to minimize.
[2024-05-27 22:45:36] [INFO ] Deduced a trap composed of 45 places in 164 ms of which 2 ms to minimize.
[2024-05-27 22:45:36] [INFO ] Deduced a trap composed of 120 places in 315 ms of which 3 ms to minimize.
[2024-05-27 22:45:37] [INFO ] Deduced a trap composed of 104 places in 215 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-27 22:45:38] [INFO ] Deduced a trap composed of 144 places in 300 ms of which 3 ms to minimize.
[2024-05-27 22:45:38] [INFO ] Deduced a trap composed of 132 places in 244 ms of which 3 ms to minimize.
[2024-05-27 22:45:39] [INFO ] Deduced a trap composed of 15 places in 306 ms of which 3 ms to minimize.
[2024-05-27 22:45:40] [INFO ] Deduced a trap composed of 178 places in 264 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 360/1442 variables, and 56 constraints, problems are : Problem set: 0 solved, 1098 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 25/28 constraints, State Equation: 0/364 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1098/1098 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1098 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-27 22:45:52] [INFO ] Deduced a trap composed of 182 places in 320 ms of which 3 ms to minimize.
[2024-05-27 22:45:53] [INFO ] Deduced a trap composed of 191 places in 276 ms of which 3 ms to minimize.
[2024-05-27 22:45:53] [INFO ] Deduced a trap composed of 191 places in 274 ms of which 3 ms to minimize.
[2024-05-27 22:45:53] [INFO ] Deduced a trap composed of 200 places in 286 ms of which 3 ms to minimize.
[2024-05-27 22:45:54] [INFO ] Deduced a trap composed of 182 places in 275 ms of which 4 ms to minimize.
[2024-05-27 22:45:54] [INFO ] Deduced a trap composed of 182 places in 313 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-27 22:46:10] [INFO ] Deduced a trap composed of 182 places in 373 ms of which 3 ms to minimize.
[2024-05-27 22:46:11] [INFO ] Deduced a trap composed of 191 places in 329 ms of which 3 ms to minimize.
[2024-05-27 22:46:11] [INFO ] Deduced a trap composed of 177 places in 397 ms of which 2 ms to minimize.
[2024-05-27 22:46:11] [INFO ] Deduced a trap composed of 189 places in 296 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 360/1442 variables, and 66 constraints, problems are : Problem set: 0 solved, 1098 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 25/28 constraints, State Equation: 0/364 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1098 constraints, Known Traps: 30/30 constraints]
After SMT, in 64276ms problems are : Problem set: 0 solved, 1098 unsolved
Search for dead transitions found 0 dead transitions in 64293ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 116352 ms. Remains : 364/364 places, 1102/1102 transitions.
Treatment of property PolyORBLF-COL-S04J04T06-LTLFireability-02 finished in 383650 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(!p1)))'
Support contains 13 out of 544 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 544/544 places, 1372/1372 transitions.
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 544 transition count 1336
Reduce places removed 36 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 42 rules applied. Total rules applied 78 place count 508 transition count 1330
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 84 place count 502 transition count 1330
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 84 place count 502 transition count 1264
Deduced a syphon composed of 66 places in 13 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 216 place count 436 transition count 1264
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 222 place count 430 transition count 1258
Iterating global reduction 3 with 6 rules applied. Total rules applied 228 place count 430 transition count 1258
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 324 place count 382 transition count 1210
Applied a total of 324 rules in 114 ms. Remains 382 /544 variables (removed 162) and now considering 1210/1372 (removed 162) transitions.
Running 1206 sub problems to find dead transitions.
[2024-05-27 22:46:18] [INFO ] Flow matrix only has 1186 transitions (discarded 24 similar events)
// Phase 1: matrix 1186 rows 382 cols
[2024-05-27 22:46:18] [INFO ] Computed 40 invariants in 40 ms
[2024-05-27 22:46:18] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-05-27 22:46:33] [INFO ] Deduced a trap composed of 49 places in 100 ms of which 3 ms to minimize.
[2024-05-27 22:46:33] [INFO ] Deduced a trap composed of 49 places in 152 ms of which 2 ms to minimize.
[2024-05-27 22:46:34] [INFO ] Deduced a trap composed of 49 places in 120 ms of which 1 ms to minimize.
[2024-05-27 22:46:34] [INFO ] Deduced a trap composed of 49 places in 89 ms of which 2 ms to minimize.
[2024-05-27 22:46:34] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 1 ms to minimize.
[2024-05-27 22:46:34] [INFO ] Deduced a trap composed of 172 places in 284 ms of which 2 ms to minimize.
[2024-05-27 22:46:35] [INFO ] Deduced a trap composed of 169 places in 282 ms of which 2 ms to minimize.
[2024-05-27 22:46:35] [INFO ] Deduced a trap composed of 183 places in 297 ms of which 3 ms to minimize.
[2024-05-27 22:46:35] [INFO ] Deduced a trap composed of 163 places in 318 ms of which 3 ms to minimize.
[2024-05-27 22:46:36] [INFO ] Deduced a trap composed of 168 places in 321 ms of which 3 ms to minimize.
[2024-05-27 22:46:37] [INFO ] Deduced a trap composed of 45 places in 212 ms of which 2 ms to minimize.
[2024-05-27 22:46:37] [INFO ] Deduced a trap composed of 49 places in 44 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 378/1568 variables, and 48 constraints, problems are : Problem set: 0 solved, 1206 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 22/25 constraints, State Equation: 0/382 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1206/1206 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-05-27 22:46:50] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 3 ms to minimize.
[2024-05-27 22:46:59] [INFO ] Deduced a trap composed of 179 places in 233 ms of which 2 ms to minimize.
[2024-05-27 22:46:59] [INFO ] Deduced a trap composed of 173 places in 271 ms of which 2 ms to minimize.
[2024-05-27 22:47:00] [INFO ] Deduced a trap composed of 168 places in 442 ms of which 4 ms to minimize.
[2024-05-27 22:47:01] [INFO ] Deduced a trap composed of 3 places in 348 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-05-27 22:47:05] [INFO ] Deduced a trap composed of 210 places in 260 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/1568 variables, and 54 constraints, problems are : Problem set: 0 solved, 1206 unsolved in 20063 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 22/25 constraints, State Equation: 0/382 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1206 constraints, Known Traps: 18/18 constraints]
After SMT, in 46872ms problems are : Problem set: 0 solved, 1206 unsolved
Search for dead transitions found 0 dead transitions in 46903ms
[2024-05-27 22:47:05] [INFO ] Flow matrix only has 1186 transitions (discarded 24 similar events)
[2024-05-27 22:47:05] [INFO ] Invariant cache hit.
[2024-05-27 22:47:06] [INFO ] Implicit Places using invariants in 481 ms returned []
[2024-05-27 22:47:06] [INFO ] Flow matrix only has 1186 transitions (discarded 24 similar events)
[2024-05-27 22:47:06] [INFO ] Invariant cache hit.
[2024-05-27 22:47:06] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:47:11] [INFO ] Implicit Places using invariants and state equation in 5272 ms returned []
Implicit Place search using SMT with State Equation took 5778 ms to find 0 implicit places.
[2024-05-27 22:47:11] [INFO ] Redundant transitions in 10 ms returned []
Running 1206 sub problems to find dead transitions.
[2024-05-27 22:47:11] [INFO ] Flow matrix only has 1186 transitions (discarded 24 similar events)
[2024-05-27 22:47:11] [INFO ] Invariant cache hit.
[2024-05-27 22:47:11] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-05-27 22:47:24] [INFO ] Deduced a trap composed of 50 places in 175 ms of which 2 ms to minimize.
[2024-05-27 22:47:24] [INFO ] Deduced a trap composed of 49 places in 101 ms of which 1 ms to minimize.
[2024-05-27 22:47:24] [INFO ] Deduced a trap composed of 49 places in 120 ms of which 1 ms to minimize.
[2024-05-27 22:47:24] [INFO ] Deduced a trap composed of 49 places in 61 ms of which 1 ms to minimize.
[2024-05-27 22:47:24] [INFO ] Deduced a trap composed of 49 places in 65 ms of which 0 ms to minimize.
[2024-05-27 22:47:25] [INFO ] Deduced a trap composed of 167 places in 268 ms of which 3 ms to minimize.
[2024-05-27 22:47:25] [INFO ] Deduced a trap composed of 163 places in 335 ms of which 2 ms to minimize.
[2024-05-27 22:47:25] [INFO ] Deduced a trap composed of 37 places in 364 ms of which 3 ms to minimize.
[2024-05-27 22:47:26] [INFO ] Deduced a trap composed of 37 places in 288 ms of which 3 ms to minimize.
[2024-05-27 22:47:26] [INFO ] Deduced a trap composed of 37 places in 374 ms of which 3 ms to minimize.
[2024-05-27 22:47:26] [INFO ] Deduced a trap composed of 154 places in 317 ms of which 2 ms to minimize.
[2024-05-27 22:47:27] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 0 ms to minimize.
[2024-05-27 22:47:36] [INFO ] Deduced a trap composed of 168 places in 247 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 378/1568 variables, and 49 constraints, problems are : Problem set: 0 solved, 1206 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 22/25 constraints, State Equation: 0/382 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1206/1206 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-05-27 22:47:50] [INFO ] Deduced a trap composed of 190 places in 271 ms of which 3 ms to minimize.
[2024-05-27 22:47:57] [INFO ] Deduced a trap composed of 54 places in 234 ms of which 2 ms to minimize.
[2024-05-27 22:47:58] [INFO ] Deduced a trap composed of 15 places in 237 ms of which 2 ms to minimize.
[2024-05-27 22:48:02] [INFO ] Deduced a trap composed of 3 places in 279 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-05-27 22:48:13] [INFO ] Deduced a trap composed of 27 places in 194 ms of which 2 ms to minimize.
[2024-05-27 22:48:16] [INFO ] Deduced a trap composed of 71 places in 264 ms of which 3 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/1568 variables, and 55 constraints, problems are : Problem set: 0 solved, 1206 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 22/25 constraints, State Equation: 0/382 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1206 constraints, Known Traps: 19/19 constraints]
After SMT, in 65609ms problems are : Problem set: 0 solved, 1206 unsolved
Search for dead transitions found 0 dead transitions in 65622ms
Starting structural reductions in SI_LTL mode, iteration 1 : 382/544 places, 1210/1372 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 118447 ms. Remains : 382/544 places, 1210/1372 transitions.
Stuttering acceptance computed with spot in 173 ms :[p1, true, p1]
Running random walk in product with property : PolyORBLF-COL-S04J04T06-LTLFireability-04
Entered a terminal (fully accepting) state of product in 61 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-COL-S04J04T06-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S04J04T06-LTLFireability-04 finished in 118658 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&(!p1 U (p2||G(!p1)))))'
Support contains 20 out of 544 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 544/544 places, 1372/1372 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 538 transition count 1366
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 538 transition count 1366
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 532 transition count 1360
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 532 transition count 1360
Applied a total of 24 rules in 27 ms. Remains 532 /544 variables (removed 12) and now considering 1360/1372 (removed 12) transitions.
Running 1356 sub problems to find dead transitions.
[2024-05-27 22:48:17] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
// Phase 1: matrix 1336 rows 532 cols
[2024-05-27 22:48:17] [INFO ] Computed 40 invariants in 29 ms
[2024-05-27 22:48:17] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-27 22:48:35] [INFO ] Deduced a trap composed of 74 places in 66 ms of which 2 ms to minimize.
[2024-05-27 22:48:35] [INFO ] Deduced a trap composed of 74 places in 101 ms of which 1 ms to minimize.
[2024-05-27 22:48:36] [INFO ] Deduced a trap composed of 74 places in 372 ms of which 3 ms to minimize.
[2024-05-27 22:48:36] [INFO ] Deduced a trap composed of 157 places in 294 ms of which 3 ms to minimize.
[2024-05-27 22:48:37] [INFO ] Deduced a trap composed of 74 places in 90 ms of which 1 ms to minimize.
[2024-05-27 22:48:39] [INFO ] Deduced a trap composed of 74 places in 68 ms of which 1 ms to minimize.
[2024-05-27 22:48:39] [INFO ] Deduced a trap composed of 74 places in 94 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1868 variables, and 43 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 7/43 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-27 22:48:46] [INFO ] Deduced a trap composed of 259 places in 319 ms of which 4 ms to minimize.
[2024-05-27 22:48:51] [INFO ] Deduced a trap composed of 63 places in 237 ms of which 2 ms to minimize.
[2024-05-27 22:48:53] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 2 ms to minimize.
[2024-05-27 22:49:02] [INFO ] Deduced a trap composed of 291 places in 255 ms of which 3 ms to minimize.
[2024-05-27 22:49:03] [INFO ] Deduced a trap composed of 274 places in 347 ms of which 4 ms to minimize.
[2024-05-27 22:49:03] [INFO ] Deduced a trap composed of 295 places in 273 ms of which 3 ms to minimize.
SMT process timed out in 46183ms, After SMT, problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 46203ms
[2024-05-27 22:49:03] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-05-27 22:49:03] [INFO ] Invariant cache hit.
[2024-05-27 22:49:03] [INFO ] Implicit Places using invariants in 485 ms returned []
[2024-05-27 22:49:03] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-05-27 22:49:03] [INFO ] Invariant cache hit.
[2024-05-27 22:49:04] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:49:11] [INFO ] Implicit Places using invariants and state equation in 8110 ms returned []
Implicit Place search using SMT with State Equation took 8607 ms to find 0 implicit places.
Running 1356 sub problems to find dead transitions.
[2024-05-27 22:49:12] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-05-27 22:49:12] [INFO ] Invariant cache hit.
[2024-05-27 22:49:12] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-27 22:49:30] [INFO ] Deduced a trap composed of 74 places in 47 ms of which 1 ms to minimize.
[2024-05-27 22:49:31] [INFO ] Deduced a trap composed of 74 places in 94 ms of which 1 ms to minimize.
[2024-05-27 22:49:31] [INFO ] Deduced a trap composed of 74 places in 75 ms of which 1 ms to minimize.
[2024-05-27 22:49:32] [INFO ] Deduced a trap composed of 39 places in 292 ms of which 2 ms to minimize.
[2024-05-27 22:49:32] [INFO ] Deduced a trap composed of 74 places in 58 ms of which 1 ms to minimize.
[2024-05-27 22:49:32] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 1 ms to minimize.
[2024-05-27 22:49:34] [INFO ] Deduced a trap composed of 74 places in 82 ms of which 1 ms to minimize.
[2024-05-27 22:49:36] [INFO ] Deduced a trap composed of 279 places in 473 ms of which 19 ms to minimize.
[2024-05-27 22:49:37] [INFO ] Deduced a trap composed of 299 places in 456 ms of which 6 ms to minimize.
[2024-05-27 22:49:37] [INFO ] Deduced a trap composed of 369 places in 472 ms of which 18 ms to minimize.
[2024-05-27 22:49:38] [INFO ] Deduced a trap composed of 291 places in 448 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1868 variables, and 47 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 11/47 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-27 22:49:50] [INFO ] Deduced a trap composed of 142 places in 387 ms of which 5 ms to minimize.
[2024-05-27 22:49:50] [INFO ] Deduced a trap composed of 145 places in 265 ms of which 3 ms to minimize.
[2024-05-27 22:49:51] [INFO ] Deduced a trap composed of 259 places in 341 ms of which 5 ms to minimize.
[2024-05-27 22:49:51] [INFO ] Deduced a trap composed of 307 places in 377 ms of which 4 ms to minimize.
[2024-05-27 22:49:58] [INFO ] Deduced a trap composed of 86 places in 181 ms of which 4 ms to minimize.
[2024-05-27 22:49:58] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 3 ms to minimize.
[2024-05-27 22:50:06] [INFO ] Deduced a trap composed of 279 places in 405 ms of which 4 ms to minimize.
[2024-05-27 22:50:07] [INFO ] Deduced a trap composed of 279 places in 406 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 8/55 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/1868 variables, and 55 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1356 constraints, Known Traps: 19/19 constraints]
After SMT, in 65433ms problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 65457ms
Starting structural reductions in LTL mode, iteration 1 : 532/544 places, 1360/1372 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 120308 ms. Remains : 532/544 places, 1360/1372 transitions.
Stuttering acceptance computed with spot in 247 ms :[true, (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : PolyORBLF-COL-S04J04T06-LTLFireability-06
Entered a terminal (fully accepting) state of product in 17 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-COL-S04J04T06-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S04J04T06-LTLFireability-06 finished in 120577 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 6 out of 544 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 544/544 places, 1372/1372 transitions.
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 544 transition count 1330
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 502 transition count 1330
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 84 place count 502 transition count 1270
Deduced a syphon composed of 60 places in 10 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 204 place count 442 transition count 1270
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 324 place count 382 transition count 1210
Applied a total of 324 rules in 85 ms. Remains 382 /544 variables (removed 162) and now considering 1210/1372 (removed 162) transitions.
Running 1206 sub problems to find dead transitions.
[2024-05-27 22:50:17] [INFO ] Flow matrix only has 1186 transitions (discarded 24 similar events)
// Phase 1: matrix 1186 rows 382 cols
[2024-05-27 22:50:17] [INFO ] Computed 40 invariants in 18 ms
[2024-05-27 22:50:17] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-05-27 22:50:32] [INFO ] Deduced a trap composed of 49 places in 147 ms of which 2 ms to minimize.
[2024-05-27 22:50:32] [INFO ] Deduced a trap composed of 49 places in 125 ms of which 1 ms to minimize.
[2024-05-27 22:50:32] [INFO ] Deduced a trap composed of 49 places in 101 ms of which 2 ms to minimize.
[2024-05-27 22:50:33] [INFO ] Deduced a trap composed of 49 places in 81 ms of which 1 ms to minimize.
[2024-05-27 22:50:33] [INFO ] Deduced a trap composed of 49 places in 79 ms of which 0 ms to minimize.
[2024-05-27 22:50:33] [INFO ] Deduced a trap composed of 192 places in 294 ms of which 3 ms to minimize.
[2024-05-27 22:50:36] [INFO ] Deduced a trap composed of 173 places in 2899 ms of which 28 ms to minimize.
[2024-05-27 22:50:36] [INFO ] Deduced a trap composed of 176 places in 328 ms of which 2 ms to minimize.
[2024-05-27 22:50:37] [INFO ] Deduced a trap composed of 45 places in 224 ms of which 2 ms to minimize.
[2024-05-27 22:50:37] [INFO ] Deduced a trap composed of 49 places in 63 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 378/1568 variables, and 46 constraints, problems are : Problem set: 0 solved, 1206 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/382 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1206/1206 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-05-27 22:50:45] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 2 ms to minimize.
[2024-05-27 22:50:57] [INFO ] Deduced a trap composed of 160 places in 245 ms of which 3 ms to minimize.
[2024-05-27 22:50:57] [INFO ] Deduced a trap composed of 128 places in 276 ms of which 2 ms to minimize.
[2024-05-27 22:50:58] [INFO ] Deduced a trap composed of 132 places in 234 ms of which 2 ms to minimize.
[2024-05-27 22:50:59] [INFO ] Deduced a trap composed of 110 places in 262 ms of which 3 ms to minimize.
[2024-05-27 22:50:59] [INFO ] Deduced a trap composed of 224 places in 250 ms of which 3 ms to minimize.
[2024-05-27 22:50:59] [INFO ] Deduced a trap composed of 166 places in 324 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-05-27 22:51:02] [INFO ] Deduced a trap composed of 190 places in 285 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/1568 variables, and 54 constraints, problems are : Problem set: 0 solved, 1206 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/382 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1206 constraints, Known Traps: 18/18 constraints]
After SMT, in 46363ms problems are : Problem set: 0 solved, 1206 unsolved
Search for dead transitions found 0 dead transitions in 46382ms
[2024-05-27 22:51:04] [INFO ] Flow matrix only has 1186 transitions (discarded 24 similar events)
[2024-05-27 22:51:04] [INFO ] Invariant cache hit.
[2024-05-27 22:51:04] [INFO ] Implicit Places using invariants in 445 ms returned []
[2024-05-27 22:51:04] [INFO ] Flow matrix only has 1186 transitions (discarded 24 similar events)
[2024-05-27 22:51:04] [INFO ] Invariant cache hit.
[2024-05-27 22:51:05] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:51:14] [INFO ] Implicit Places using invariants and state equation in 9685 ms returned []
Implicit Place search using SMT with State Equation took 10133 ms to find 0 implicit places.
[2024-05-27 22:51:14] [INFO ] Redundant transitions in 21 ms returned []
Running 1206 sub problems to find dead transitions.
[2024-05-27 22:51:14] [INFO ] Flow matrix only has 1186 transitions (discarded 24 similar events)
[2024-05-27 22:51:14] [INFO ] Invariant cache hit.
[2024-05-27 22:51:14] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-05-27 22:51:27] [INFO ] Deduced a trap composed of 49 places in 88 ms of which 1 ms to minimize.
[2024-05-27 22:51:27] [INFO ] Deduced a trap composed of 49 places in 112 ms of which 1 ms to minimize.
[2024-05-27 22:51:27] [INFO ] Deduced a trap composed of 49 places in 44 ms of which 1 ms to minimize.
[2024-05-27 22:51:27] [INFO ] Deduced a trap composed of 49 places in 46 ms of which 1 ms to minimize.
[2024-05-27 22:51:27] [INFO ] Deduced a trap composed of 49 places in 45 ms of which 1 ms to minimize.
[2024-05-27 22:51:28] [INFO ] Deduced a trap composed of 168 places in 312 ms of which 2 ms to minimize.
[2024-05-27 22:51:28] [INFO ] Deduced a trap composed of 157 places in 257 ms of which 2 ms to minimize.
[2024-05-27 22:51:28] [INFO ] Deduced a trap composed of 49 places in 298 ms of which 3 ms to minimize.
[2024-05-27 22:51:29] [INFO ] Deduced a trap composed of 160 places in 312 ms of which 2 ms to minimize.
[2024-05-27 22:51:29] [INFO ] Deduced a trap composed of 181 places in 328 ms of which 3 ms to minimize.
[2024-05-27 22:51:29] [INFO ] Deduced a trap composed of 163 places in 328 ms of which 3 ms to minimize.
[2024-05-27 22:51:31] [INFO ] Deduced a trap composed of 45 places in 198 ms of which 1 ms to minimize.
[2024-05-27 22:51:42] [INFO ] Deduced a trap composed of 133 places in 347 ms of which 2 ms to minimize.
[2024-05-27 22:51:43] [INFO ] Deduced a trap composed of 197 places in 321 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 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)
(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 9.0)
(s105 0.0)
(s106 1.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 1.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 1.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 378/1568 variables, and 50 constraints, problems are : Problem set: 0 solved, 1206 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/382 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1206/1206 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-05-27 22:51:59] [INFO ] Deduced a trap composed of 15 places in 211 ms of which 2 ms to minimize.
[2024-05-27 22:52:03] [INFO ] Deduced a trap composed of 44 places in 225 ms of which 2 ms to minimize.
[2024-05-27 22:52:04] [INFO ] Deduced a trap composed of 113 places in 621 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-05-27 22:52:16] [INFO ] Deduced a trap composed of 167 places in 293 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/1568 variables, and 54 constraints, problems are : Problem set: 0 solved, 1206 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/382 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1206 constraints, Known Traps: 18/18 constraints]
After SMT, in 66134ms problems are : Problem set: 0 solved, 1206 unsolved
Search for dead transitions found 0 dead transitions in 66158ms
Starting structural reductions in SI_LTL mode, iteration 1 : 382/544 places, 1210/1372 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 122802 ms. Remains : 382/544 places, 1210/1372 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J04T06-LTLFireability-07
Product exploration explored 100000 steps with 1482 reset in 433 ms.
Product exploration explored 100000 steps with 1467 reset in 398 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 120 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 75 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 255 steps (0 resets) in 5 ms. (42 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
[2024-05-27 22:52:22] [INFO ] Flow matrix only has 1186 transitions (discarded 24 similar events)
[2024-05-27 22:52:22] [INFO ] Invariant cache hit.
[2024-05-27 22:52:22] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2024-05-27 22:52:22] [INFO ] [Real]Absence check using 15 positive and 25 generalized place invariants in 110 ms returned sat
[2024-05-27 22:52:24] [INFO ] [Real]Absence check using state equation in 1530 ms returned sat
[2024-05-27 22:52:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:52:25] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-05-27 22:52:25] [INFO ] [Nat]Absence check using 15 positive and 25 generalized place invariants in 49 ms returned sat
[2024-05-27 22:52:26] [INFO ] [Nat]Absence check using state equation in 1130 ms returned sat
[2024-05-27 22:52:26] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:52:26] [INFO ] [Nat]Added 120 Read/Feed constraints in 172 ms returned sat
[2024-05-27 22:52:26] [INFO ] Deduced a trap composed of 49 places in 470 ms of which 3 ms to minimize.
[2024-05-27 22:52:27] [INFO ] Deduced a trap composed of 45 places in 372 ms of which 3 ms to minimize.
[2024-05-27 22:52:28] [INFO ] Deduced a trap composed of 49 places in 79 ms of which 1 ms to minimize.
[2024-05-27 22:52:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2318 ms
[2024-05-27 22:52:28] [INFO ] Computed and/alt/rep : 786/3319/768 causal constraints (skipped 414 transitions) in 160 ms.
[2024-05-27 22:52:35] [INFO ] Added : 251 causal constraints over 51 iterations in 6389 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 6 out of 382 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 382/382 places, 1210/1210 transitions.
Applied a total of 0 rules in 66 ms. Remains 382 /382 variables (removed 0) and now considering 1210/1210 (removed 0) transitions.
Running 1206 sub problems to find dead transitions.
[2024-05-27 22:52:35] [INFO ] Flow matrix only has 1186 transitions (discarded 24 similar events)
[2024-05-27 22:52:35] [INFO ] Invariant cache hit.
[2024-05-27 22:52:35] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-05-27 22:52:49] [INFO ] Deduced a trap composed of 49 places in 114 ms of which 2 ms to minimize.
[2024-05-27 22:52:49] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 1 ms to minimize.
[2024-05-27 22:52:49] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 1 ms to minimize.
[2024-05-27 22:52:49] [INFO ] Deduced a trap composed of 49 places in 57 ms of which 1 ms to minimize.
[2024-05-27 22:52:49] [INFO ] Deduced a trap composed of 49 places in 52 ms of which 1 ms to minimize.
[2024-05-27 22:52:49] [INFO ] Deduced a trap composed of 168 places in 334 ms of which 3 ms to minimize.
[2024-05-27 22:52:50] [INFO ] Deduced a trap composed of 157 places in 325 ms of which 2 ms to minimize.
[2024-05-27 22:52:50] [INFO ] Deduced a trap composed of 49 places in 297 ms of which 3 ms to minimize.
[2024-05-27 22:52:50] [INFO ] Deduced a trap composed of 160 places in 335 ms of which 3 ms to minimize.
[2024-05-27 22:52:51] [INFO ] Deduced a trap composed of 181 places in 295 ms of which 2 ms to minimize.
[2024-05-27 22:52:51] [INFO ] Deduced a trap composed of 163 places in 274 ms of which 3 ms to minimize.
[2024-05-27 22:52:52] [INFO ] Deduced a trap composed of 45 places in 221 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 378/1568 variables, and 48 constraints, problems are : Problem set: 0 solved, 1206 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/382 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1206/1206 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-05-27 22:53:05] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 2 ms to minimize.
[2024-05-27 22:53:14] [INFO ] Deduced a trap composed of 132 places in 312 ms of which 2 ms to minimize.
[2024-05-27 22:53:15] [INFO ] Deduced a trap composed of 154 places in 282 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-05-27 22:53:18] [INFO ] Deduced a trap composed of 210 places in 259 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/1568 variables, and 52 constraints, problems are : Problem set: 0 solved, 1206 unsolved in 20047 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/382 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1206 constraints, Known Traps: 16/16 constraints]
After SMT, in 46548ms problems are : Problem set: 0 solved, 1206 unsolved
Search for dead transitions found 0 dead transitions in 46604ms
[2024-05-27 22:53:21] [INFO ] Flow matrix only has 1186 transitions (discarded 24 similar events)
[2024-05-27 22:53:21] [INFO ] Invariant cache hit.
[2024-05-27 22:53:22] [INFO ] Implicit Places using invariants in 459 ms returned []
[2024-05-27 22:53:22] [INFO ] Flow matrix only has 1186 transitions (discarded 24 similar events)
[2024-05-27 22:53:22] [INFO ] Invariant cache hit.
[2024-05-27 22:53:22] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:53:29] [INFO ] Implicit Places using invariants and state equation in 7746 ms returned []
Implicit Place search using SMT with State Equation took 8223 ms to find 0 implicit places.
[2024-05-27 22:53:30] [INFO ] Redundant transitions in 9 ms returned []
Running 1206 sub problems to find dead transitions.
[2024-05-27 22:53:30] [INFO ] Flow matrix only has 1186 transitions (discarded 24 similar events)
[2024-05-27 22:53:30] [INFO ] Invariant cache hit.
[2024-05-27 22:53:30] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-05-27 22:53:45] [INFO ] Deduced a trap composed of 49 places in 115 ms of which 2 ms to minimize.
[2024-05-27 22:53:45] [INFO ] Deduced a trap composed of 49 places in 65 ms of which 1 ms to minimize.
[2024-05-27 22:53:45] [INFO ] Deduced a trap composed of 49 places in 46 ms of which 0 ms to minimize.
[2024-05-27 22:53:45] [INFO ] Deduced a trap composed of 49 places in 53 ms of which 0 ms to minimize.
[2024-05-27 22:53:45] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 0 ms to minimize.
[2024-05-27 22:53:46] [INFO ] Deduced a trap composed of 168 places in 335 ms of which 3 ms to minimize.
[2024-05-27 22:53:46] [INFO ] Deduced a trap composed of 157 places in 316 ms of which 3 ms to minimize.
[2024-05-27 22:53:46] [INFO ] Deduced a trap composed of 49 places in 337 ms of which 2 ms to minimize.
[2024-05-27 22:53:47] [INFO ] Deduced a trap composed of 160 places in 335 ms of which 3 ms to minimize.
[2024-05-27 22:53:47] [INFO ] Deduced a trap composed of 181 places in 288 ms of which 2 ms to minimize.
[2024-05-27 22:53:47] [INFO ] Deduced a trap composed of 163 places in 311 ms of which 2 ms to minimize.
[2024-05-27 22:53:48] [INFO ] Deduced a trap composed of 45 places in 238 ms of which 2 ms to minimize.
[2024-05-27 22:53:58] [INFO ] Deduced a trap composed of 133 places in 305 ms of which 3 ms to minimize.
[2024-05-27 22:53:59] [INFO ] Deduced a trap composed of 197 places in 304 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 378/1568 variables, and 50 constraints, problems are : Problem set: 0 solved, 1206 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/382 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1206/1206 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-05-27 22:54:15] [INFO ] Deduced a trap composed of 15 places in 254 ms of which 3 ms to minimize.
[2024-05-27 22:54:20] [INFO ] Deduced a trap composed of 44 places in 304 ms of which 3 ms to minimize.
[2024-05-27 22:54:20] [INFO ] Deduced a trap composed of 113 places in 318 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-05-27 22:54:23] [INFO ] Deduced a trap composed of 167 places in 244 ms of which 3 ms to minimize.
[2024-05-27 22:54:35] [INFO ] Deduced a trap composed of 167 places in 304 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/1568 variables, and 55 constraints, problems are : Problem set: 0 solved, 1206 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/382 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1206 constraints, Known Traps: 19/19 constraints]
After SMT, in 66314ms problems are : Problem set: 0 solved, 1206 unsolved
Search for dead transitions found 0 dead transitions in 66329ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 121255 ms. Remains : 382/382 places, 1210/1210 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 163 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 117 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 253 steps (0 resets) in 7 ms. (31 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
[2024-05-27 22:54:37] [INFO ] Flow matrix only has 1186 transitions (discarded 24 similar events)
[2024-05-27 22:54:37] [INFO ] Invariant cache hit.
[2024-05-27 22:54:37] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-05-27 22:54:37] [INFO ] [Real]Absence check using 15 positive and 25 generalized place invariants in 77 ms returned sat
[2024-05-27 22:54:38] [INFO ] [Real]Absence check using state equation in 796 ms returned sat
[2024-05-27 22:54:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:54:39] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned sat
[2024-05-27 22:54:39] [INFO ] [Nat]Absence check using 15 positive and 25 generalized place invariants in 79 ms returned sat
[2024-05-27 22:54:41] [INFO ] [Nat]Absence check using state equation in 2143 ms returned sat
[2024-05-27 22:54:41] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:54:41] [INFO ] [Nat]Added 120 Read/Feed constraints in 187 ms returned sat
[2024-05-27 22:54:42] [INFO ] Deduced a trap composed of 49 places in 258 ms of which 2 ms to minimize.
[2024-05-27 22:54:43] [INFO ] Deduced a trap composed of 45 places in 394 ms of which 2 ms to minimize.
[2024-05-27 22:54:43] [INFO ] Deduced a trap composed of 49 places in 106 ms of which 2 ms to minimize.
[2024-05-27 22:54:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2188 ms
[2024-05-27 22:54:44] [INFO ] Computed and/alt/rep : 786/3319/768 causal constraints (skipped 414 transitions) in 118 ms.
[2024-05-27 22:54:50] [INFO ] Added : 251 causal constraints over 51 iterations in 6691 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1473 reset in 561 ms.
Product exploration explored 100000 steps with 1476 reset in 518 ms.
Support contains 6 out of 382 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 382/382 places, 1210/1210 transitions.
Applied a total of 0 rules in 20 ms. Remains 382 /382 variables (removed 0) and now considering 1210/1210 (removed 0) transitions.
Running 1206 sub problems to find dead transitions.
[2024-05-27 22:54:51] [INFO ] Flow matrix only has 1186 transitions (discarded 24 similar events)
[2024-05-27 22:54:51] [INFO ] Invariant cache hit.
[2024-05-27 22:54:51] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-05-27 22:55:04] [INFO ] Deduced a trap composed of 49 places in 151 ms of which 2 ms to minimize.
[2024-05-27 22:55:04] [INFO ] Deduced a trap composed of 49 places in 81 ms of which 1 ms to minimize.
[2024-05-27 22:55:05] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 1 ms to minimize.
[2024-05-27 22:55:05] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 1 ms to minimize.
[2024-05-27 22:55:05] [INFO ] Deduced a trap composed of 49 places in 52 ms of which 1 ms to minimize.
[2024-05-27 22:55:05] [INFO ] Deduced a trap composed of 168 places in 276 ms of which 2 ms to minimize.
[2024-05-27 22:55:05] [INFO ] Deduced a trap composed of 157 places in 338 ms of which 3 ms to minimize.
[2024-05-27 22:55:06] [INFO ] Deduced a trap composed of 49 places in 295 ms of which 3 ms to minimize.
[2024-05-27 22:55:06] [INFO ] Deduced a trap composed of 160 places in 320 ms of which 3 ms to minimize.
[2024-05-27 22:55:06] [INFO ] Deduced a trap composed of 181 places in 361 ms of which 3 ms to minimize.
[2024-05-27 22:55:07] [INFO ] Deduced a trap composed of 163 places in 331 ms of which 3 ms to minimize.
[2024-05-27 22:55:08] [INFO ] Deduced a trap composed of 45 places in 192 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 378/1568 variables, and 48 constraints, problems are : Problem set: 0 solved, 1206 unsolved in 20055 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/382 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1206/1206 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-05-27 22:55:22] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 2 ms to minimize.
[2024-05-27 22:55:37] [INFO ] Deduced a trap composed of 132 places in 240 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/1568 variables, and 50 constraints, problems are : Problem set: 0 solved, 1206 unsolved in 20070 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/382 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1206 constraints, Known Traps: 14/14 constraints]
After SMT, in 46193ms problems are : Problem set: 0 solved, 1206 unsolved
Search for dead transitions found 0 dead transitions in 46211ms
[2024-05-27 22:55:38] [INFO ] Flow matrix only has 1186 transitions (discarded 24 similar events)
[2024-05-27 22:55:38] [INFO ] Invariant cache hit.
[2024-05-27 22:55:38] [INFO ] Implicit Places using invariants in 457 ms returned []
[2024-05-27 22:55:38] [INFO ] Flow matrix only has 1186 transitions (discarded 24 similar events)
[2024-05-27 22:55:38] [INFO ] Invariant cache hit.
[2024-05-27 22:55:39] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:55:45] [INFO ] Implicit Places using invariants and state equation in 6661 ms returned []
Implicit Place search using SMT with State Equation took 7126 ms to find 0 implicit places.
[2024-05-27 22:55:45] [INFO ] Redundant transitions in 9 ms returned []
Running 1206 sub problems to find dead transitions.
[2024-05-27 22:55:45] [INFO ] Flow matrix only has 1186 transitions (discarded 24 similar events)
[2024-05-27 22:55:45] [INFO ] Invariant cache hit.
[2024-05-27 22:55:45] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-05-27 22:56:05] [INFO ] Deduced a trap composed of 49 places in 131 ms of which 1 ms to minimize.
[2024-05-27 22:56:05] [INFO ] Deduced a trap composed of 49 places in 107 ms of which 1 ms to minimize.
[2024-05-27 22:56:05] [INFO ] Deduced a trap composed of 49 places in 57 ms of which 0 ms to minimize.
[2024-05-27 22:56:06] [INFO ] Deduced a trap composed of 49 places in 57 ms of which 0 ms to minimize.
[2024-05-27 22:56:06] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 1 ms to minimize.
[2024-05-27 22:56:06] [INFO ] Deduced a trap composed of 168 places in 386 ms of which 3 ms to minimize.
[2024-05-27 22:56:06] [INFO ] Deduced a trap composed of 157 places in 352 ms of which 3 ms to minimize.
[2024-05-27 22:56:07] [INFO ] Deduced a trap composed of 49 places in 336 ms of which 3 ms to minimize.
[2024-05-27 22:56:07] [INFO ] Deduced a trap composed of 160 places in 314 ms of which 3 ms to minimize.
[2024-05-27 22:56:07] [INFO ] Deduced a trap composed of 181 places in 293 ms of which 2 ms to minimize.
[2024-05-27 22:56:08] [INFO ] Deduced a trap composed of 163 places in 291 ms of which 3 ms to minimize.
[2024-05-27 22:56:09] [INFO ] Deduced a trap composed of 45 places in 267 ms of which 1 ms to minimize.
[2024-05-27 22:56:19] [INFO ] Deduced a trap composed of 133 places in 267 ms of which 3 ms to minimize.
[2024-05-27 22:56:20] [INFO ] Deduced a trap composed of 197 places in 252 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 1206 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 378/1568 variables, and 50 constraints, problems are : Problem set: 0 solved, 1206 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/382 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1206/1206 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-05-27 22:56:30] [INFO ] Deduced a trap composed of 15 places in 201 ms of which 2 ms to minimize.
[2024-05-27 22:56:35] [INFO ] Deduced a trap composed of 44 places in 272 ms of which 2 ms to minimize.
[2024-05-27 22:56:36] [INFO ] Deduced a trap composed of 113 places in 276 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-05-27 22:56:38] [INFO ] Deduced a trap composed of 167 places in 276 ms of which 3 ms to minimize.
[2024-05-27 22:56:48] [INFO ] Deduced a trap composed of 167 places in 311 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/1568 variables, and 55 constraints, problems are : Problem set: 0 solved, 1206 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/382 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1206 constraints, Known Traps: 19/19 constraints]
After SMT, in 66192ms problems are : Problem set: 0 solved, 1206 unsolved
Search for dead transitions found 0 dead transitions in 66207ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 119589 ms. Remains : 382/382 places, 1210/1210 transitions.
Treatment of property PolyORBLF-COL-S04J04T06-LTLFireability-07 finished in 393794 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(F(p1))||p0)))'
Support contains 13 out of 544 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 544/544 places, 1372/1372 transitions.
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 544 transition count 1330
Reduce places removed 42 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 48 rules applied. Total rules applied 90 place count 502 transition count 1324
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 96 place count 496 transition count 1324
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 96 place count 496 transition count 1264
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 216 place count 436 transition count 1264
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 222 place count 430 transition count 1258
Iterating global reduction 3 with 6 rules applied. Total rules applied 228 place count 430 transition count 1258
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 336 place count 376 transition count 1204
Applied a total of 336 rules in 83 ms. Remains 376 /544 variables (removed 168) and now considering 1204/1372 (removed 168) transitions.
Running 1200 sub problems to find dead transitions.
[2024-05-27 22:56:51] [INFO ] Flow matrix only has 1180 transitions (discarded 24 similar events)
// Phase 1: matrix 1180 rows 376 cols
[2024-05-27 22:56:51] [INFO ] Computed 40 invariants in 49 ms
[2024-05-27 22:56:51] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/372 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-27 22:57:05] [INFO ] Deduced a trap composed of 29 places in 205 ms of which 2 ms to minimize.
[2024-05-27 22:57:05] [INFO ] Deduced a trap composed of 48 places in 128 ms of which 2 ms to minimize.
[2024-05-27 22:57:05] [INFO ] Deduced a trap composed of 48 places in 67 ms of which 1 ms to minimize.
[2024-05-27 22:57:05] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 1 ms to minimize.
[2024-05-27 22:57:05] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 1 ms to minimize.
[2024-05-27 22:57:05] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 1 ms to minimize.
[2024-05-27 22:57:06] [INFO ] Deduced a trap composed of 168 places in 320 ms of which 3 ms to minimize.
[2024-05-27 22:57:06] [INFO ] Deduced a trap composed of 149 places in 320 ms of which 4 ms to minimize.
[2024-05-27 22:57:07] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 1 ms to minimize.
[2024-05-27 22:57:08] [INFO ] Deduced a trap composed of 190 places in 219 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 0.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 9.0)
(s111 0.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.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 1.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 1.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 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 1.0)
(s269 1.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 6.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 1.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 4.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 1.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 6.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 1.0)
(s354 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 372/1556 variables, and 46 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 20056 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/376 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/372 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/372 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-27 22:57:26] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 2 ms to minimize.
[2024-05-27 22:57:36] [INFO ] Deduced a trap composed of 120 places in 317 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/1556 variables, and 48 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/376 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 12/12 constraints]
After SMT, in 46799ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 46817ms
[2024-05-27 22:57:38] [INFO ] Flow matrix only has 1180 transitions (discarded 24 similar events)
[2024-05-27 22:57:38] [INFO ] Invariant cache hit.
[2024-05-27 22:57:38] [INFO ] Implicit Places using invariants in 351 ms returned []
[2024-05-27 22:57:38] [INFO ] Flow matrix only has 1180 transitions (discarded 24 similar events)
[2024-05-27 22:57:38] [INFO ] Invariant cache hit.
[2024-05-27 22:57:39] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:57:44] [INFO ] Implicit Places using invariants and state equation in 5248 ms returned []
Implicit Place search using SMT with State Equation took 5600 ms to find 0 implicit places.
[2024-05-27 22:57:44] [INFO ] Redundant transitions in 21 ms returned []
Running 1200 sub problems to find dead transitions.
[2024-05-27 22:57:44] [INFO ] Flow matrix only has 1180 transitions (discarded 24 similar events)
[2024-05-27 22:57:44] [INFO ] Invariant cache hit.
[2024-05-27 22:57:44] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/372 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-27 22:57:57] [INFO ] Deduced a trap composed of 48 places in 140 ms of which 2 ms to minimize.
[2024-05-27 22:57:57] [INFO ] Deduced a trap composed of 48 places in 105 ms of which 1 ms to minimize.
[2024-05-27 22:57:57] [INFO ] Deduced a trap composed of 48 places in 56 ms of which 1 ms to minimize.
[2024-05-27 22:57:57] [INFO ] Deduced a trap composed of 48 places in 36 ms of which 1 ms to minimize.
[2024-05-27 22:57:57] [INFO ] Deduced a trap composed of 48 places in 37 ms of which 1 ms to minimize.
[2024-05-27 22:57:58] [INFO ] Deduced a trap composed of 157 places in 266 ms of which 3 ms to minimize.
[2024-05-27 22:57:58] [INFO ] Deduced a trap composed of 147 places in 329 ms of which 3 ms to minimize.
[2024-05-27 22:57:58] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 1 ms to minimize.
[2024-05-27 22:58:08] [INFO ] Deduced a trap composed of 120 places in 218 ms of which 2 ms to minimize.
[2024-05-27 22:58:09] [INFO ] Deduced a trap composed of 133 places in 210 ms of which 2 ms to minimize.
[2024-05-27 22:58:09] [INFO ] Deduced a trap composed of 181 places in 228 ms of which 2 ms to minimize.
[2024-05-27 22:58:09] [INFO ] Deduced a trap composed of 61 places in 220 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/372 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-27 22:58:12] [INFO ] Deduced a trap composed of 210 places in 251 ms of which 3 ms to minimize.
[2024-05-27 22:58:17] [INFO ] Deduced a trap composed of 27 places in 173 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 372/1556 variables, and 50 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/376 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/372 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/372 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-27 22:58:31] [INFO ] Deduced a trap composed of 18 places in 226 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/372 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/1556 variables, and 51 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/376 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 15/15 constraints]
After SMT, in 65568ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 65592ms
Starting structural reductions in SI_LTL mode, iteration 1 : 376/544 places, 1204/1372 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 118129 ms. Remains : 376/544 places, 1204/1372 transitions.
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-COL-S04J04T06-LTLFireability-08
Product exploration explored 100000 steps with 3997 reset in 481 ms.
Product exploration explored 100000 steps with 4025 reset in 623 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 (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 603 steps (0 resets) in 14 ms. (40 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 7 factoid took 176 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-27 22:58:51] [INFO ] Flow matrix only has 1180 transitions (discarded 24 similar events)
[2024-05-27 22:58:51] [INFO ] Invariant cache hit.
[2024-05-27 22:58:52] [INFO ] [Real]Absence check using 16 positive place invariants in 64 ms returned sat
[2024-05-27 22:58:52] [INFO ] [Real]Absence check using 16 positive and 24 generalized place invariants in 164 ms returned sat
[2024-05-27 22:58:54] [INFO ] [Real]Absence check using state equation in 1566 ms returned sat
[2024-05-27 22:58:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:58:54] [INFO ] [Nat]Absence check using 16 positive place invariants in 15 ms returned sat
[2024-05-27 22:58:54] [INFO ] [Nat]Absence check using 16 positive and 24 generalized place invariants in 98 ms returned sat
[2024-05-27 22:58:59] [INFO ] [Nat]Absence check using state equation in 4230 ms returned sat
[2024-05-27 22:58:59] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:58:59] [INFO ] [Nat]Added 120 Read/Feed constraints in 251 ms returned sat
[2024-05-27 22:58:59] [INFO ] Deduced a trap composed of 48 places in 296 ms of which 3 ms to minimize.
[2024-05-27 22:59:00] [INFO ] Deduced a trap composed of 27 places in 288 ms of which 3 ms to minimize.
[2024-05-27 22:59:01] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 2261 ms
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 13 out of 376 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 376/376 places, 1204/1204 transitions.
Applied a total of 0 rules in 42 ms. Remains 376 /376 variables (removed 0) and now considering 1204/1204 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-05-27 22:59:01] [INFO ] Flow matrix only has 1180 transitions (discarded 24 similar events)
[2024-05-27 22:59:01] [INFO ] Invariant cache hit.
[2024-05-27 22:59:01] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/372 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-27 22:59:15] [INFO ] Deduced a trap composed of 48 places in 114 ms of which 2 ms to minimize.
[2024-05-27 22:59:15] [INFO ] Deduced a trap composed of 48 places in 128 ms of which 1 ms to minimize.
[2024-05-27 22:59:15] [INFO ] Deduced a trap composed of 48 places in 103 ms of which 1 ms to minimize.
[2024-05-27 22:59:15] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 1 ms to minimize.
[2024-05-27 22:59:15] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 1 ms to minimize.
[2024-05-27 22:59:16] [INFO ] Deduced a trap composed of 157 places in 314 ms of which 3 ms to minimize.
[2024-05-27 22:59:16] [INFO ] Deduced a trap composed of 147 places in 364 ms of which 2 ms to minimize.
[2024-05-27 22:59:17] [INFO ] Deduced a trap composed of 48 places in 91 ms of which 1 ms to minimize.
[2024-05-27 22:59:26] [INFO ] Deduced a trap composed of 120 places in 287 ms of which 2 ms to minimize.
[2024-05-27 22:59:27] [INFO ] Deduced a trap composed of 133 places in 263 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 372/1556 variables, and 46 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 20065 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/376 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/372 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/372 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-27 22:59:30] [INFO ] Deduced a trap composed of 51 places in 210 ms of which 2 ms to minimize.
[2024-05-27 22:59:31] [INFO ] Deduced a trap composed of 190 places in 322 ms of which 2 ms to minimize.
[2024-05-27 22:59:32] [INFO ] Deduced a trap composed of 40 places in 164 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/372 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/1556 variables, and 49 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/376 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 13/13 constraints]
After SMT, in 45752ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 45783ms
[2024-05-27 22:59:47] [INFO ] Flow matrix only has 1180 transitions (discarded 24 similar events)
[2024-05-27 22:59:47] [INFO ] Invariant cache hit.
[2024-05-27 22:59:47] [INFO ] Implicit Places using invariants in 386 ms returned []
[2024-05-27 22:59:47] [INFO ] Flow matrix only has 1180 transitions (discarded 24 similar events)
[2024-05-27 22:59:47] [INFO ] Invariant cache hit.
[2024-05-27 22:59:48] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:59:52] [INFO ] Implicit Places using invariants and state equation in 4132 ms returned []
Implicit Place search using SMT with State Equation took 4536 ms to find 0 implicit places.
[2024-05-27 22:59:52] [INFO ] Redundant transitions in 20 ms returned []
Running 1200 sub problems to find dead transitions.
[2024-05-27 22:59:52] [INFO ] Flow matrix only has 1180 transitions (discarded 24 similar events)
[2024-05-27 22:59:52] [INFO ] Invariant cache hit.
[2024-05-27 22:59:52] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/372 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-27 23:00:06] [INFO ] Deduced a trap composed of 48 places in 116 ms of which 1 ms to minimize.
[2024-05-27 23:00:07] [INFO ] Deduced a trap composed of 48 places in 116 ms of which 2 ms to minimize.
[2024-05-27 23:00:07] [INFO ] Deduced a trap composed of 48 places in 84 ms of which 2 ms to minimize.
[2024-05-27 23:00:07] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 0 ms to minimize.
[2024-05-27 23:00:07] [INFO ] Deduced a trap composed of 48 places in 67 ms of which 1 ms to minimize.
[2024-05-27 23:00:07] [INFO ] Deduced a trap composed of 157 places in 262 ms of which 2 ms to minimize.
[2024-05-27 23:00:07] [INFO ] Deduced a trap composed of 147 places in 306 ms of which 2 ms to minimize.
[2024-05-27 23:00:08] [INFO ] Deduced a trap composed of 48 places in 60 ms of which 1 ms to minimize.
[2024-05-27 23:00:24] [INFO ] Deduced a trap composed of 120 places in 343 ms of which 2 ms to minimize.
[2024-05-27 23:00:25] [INFO ] Deduced a trap composed of 133 places in 334 ms of which 2 ms to minimize.
[2024-05-27 23:00:25] [INFO ] Deduced a trap composed of 181 places in 341 ms of which 2 ms to minimize.
[2024-05-27 23:00:26] [INFO ] Deduced a trap composed of 61 places in 298 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/372 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 1200 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 372/1556 variables, and 48 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/376 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/372 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/372 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-27 23:00:32] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 2 ms to minimize.
[2024-05-27 23:00:41] [INFO ] Deduced a trap composed of 51 places in 197 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/372 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/1556 variables, and 50 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/376 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 14/14 constraints]
After SMT, in 66211ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 66230ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 116627 ms. Remains : 376/376 places, 1204/1204 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 135 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 94 steps (0 resets) in 7 ms. (11 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 7 factoid took 224 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-27 23:00:58] [INFO ] Flow matrix only has 1180 transitions (discarded 24 similar events)
[2024-05-27 23:00:58] [INFO ] Invariant cache hit.
[2024-05-27 23:00:59] [INFO ] [Real]Absence check using 16 positive place invariants in 26 ms returned sat
[2024-05-27 23:00:59] [INFO ] [Real]Absence check using 16 positive and 24 generalized place invariants in 98 ms returned sat
[2024-05-27 23:01:01] [INFO ] [Real]Absence check using state equation in 1513 ms returned sat
[2024-05-27 23:01:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 23:01:01] [INFO ] [Nat]Absence check using 16 positive place invariants in 12 ms returned sat
[2024-05-27 23:01:01] [INFO ] [Nat]Absence check using 16 positive and 24 generalized place invariants in 37 ms returned sat
[2024-05-27 23:01:05] [INFO ] [Nat]Absence check using state equation in 4026 ms returned sat
[2024-05-27 23:01:05] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 23:01:06] [INFO ] [Nat]Added 120 Read/Feed constraints in 418 ms returned sat
[2024-05-27 23:01:06] [INFO ] Deduced a trap composed of 48 places in 426 ms of which 4 ms to minimize.
[2024-05-27 23:01:07] [INFO ] Deduced a trap composed of 27 places in 347 ms of which 3 ms to minimize.
[2024-05-27 23:01:07] [INFO ] Deduced a trap composed of 3 places in 249 ms of which 3 ms to minimize.
[2024-05-27 23:01:07] [INFO ] Deduced a trap composed of 48 places in 59 ms of which 1 ms to minimize.
[2024-05-27 23:01:07] [INFO ] Deduced a trap composed of 48 places in 35 ms of which 1 ms to minimize.
[2024-05-27 23:01:07] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1574 ms
[2024-05-27 23:01:07] [INFO ] Computed and/alt/rep : 780/3313/762 causal constraints (skipped 414 transitions) in 75 ms.
[2024-05-27 23:01:09] [INFO ] Added : 121 causal constraints over 25 iterations in 1913 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4009 reset in 521 ms.
Product exploration explored 100000 steps with 3976 reset in 481 ms.
Support contains 13 out of 376 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 376/376 places, 1204/1204 transitions.
Applied a total of 0 rules in 29 ms. Remains 376 /376 variables (removed 0) and now considering 1204/1204 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-05-27 23:01:10] [INFO ] Flow matrix only has 1180 transitions (discarded 24 similar events)
[2024-05-27 23:01:10] [INFO ] Invariant cache hit.
[2024-05-27 23:01:10] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/372 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-27 23:01:25] [INFO ] Deduced a trap composed of 48 places in 113 ms of which 1 ms to minimize.
[2024-05-27 23:01:25] [INFO ] Deduced a trap composed of 48 places in 120 ms of which 2 ms to minimize.
[2024-05-27 23:01:26] [INFO ] Deduced a trap composed of 48 places in 97 ms of which 2 ms to minimize.
[2024-05-27 23:01:26] [INFO ] Deduced a trap composed of 48 places in 60 ms of which 1 ms to minimize.
[2024-05-27 23:01:26] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 0 ms to minimize.
[2024-05-27 23:01:26] [INFO ] Deduced a trap composed of 157 places in 380 ms of which 3 ms to minimize.
[2024-05-27 23:01:27] [INFO ] Deduced a trap composed of 147 places in 361 ms of which 3 ms to minimize.
[2024-05-27 23:01:27] [INFO ] Deduced a trap composed of 48 places in 80 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 5.0)
(s1 5.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 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 1.0)
(s70 1.0)
(s71 0.0)
(s72 1.0)
(s73 1.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 9.0)
(s111 0.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 1.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 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 4.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 1.0)
(s273 0.0)
(s274 1.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 1.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 1.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 1.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 6.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 372/1556 variables, and 44 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/376 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/372 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/372 variables, 8/44 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-27 23:01:40] [INFO ] Deduced a trap composed of 51 places in 194 ms of which 2 ms to minimize.
[2024-05-27 23:01:42] [INFO ] Deduced a trap composed of 190 places in 295 ms of which 3 ms to minimize.
[2024-05-27 23:01:43] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 2 ms to minimize.
[2024-05-27 23:01:52] [INFO ] Deduced a trap composed of 122 places in 267 ms of which 2 ms to minimize.
[2024-05-27 23:01:53] [INFO ] Deduced a trap composed of 117 places in 277 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/372 variables, 5/49 constraints. Problems are: Problem set: 0 solved, 1200 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 372/1556 variables, and 49 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 20051 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/376 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 13/13 constraints]
After SMT, in 46264ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 46288ms
[2024-05-27 23:01:57] [INFO ] Flow matrix only has 1180 transitions (discarded 24 similar events)
[2024-05-27 23:01:57] [INFO ] Invariant cache hit.
[2024-05-27 23:01:57] [INFO ] Implicit Places using invariants in 411 ms returned []
[2024-05-27 23:01:57] [INFO ] Flow matrix only has 1180 transitions (discarded 24 similar events)
[2024-05-27 23:01:57] [INFO ] Invariant cache hit.
[2024-05-27 23:01:58] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 23:02:01] [INFO ] Implicit Places using invariants and state equation in 4283 ms returned []
Implicit Place search using SMT with State Equation took 4704 ms to find 0 implicit places.
[2024-05-27 23:02:01] [INFO ] Redundant transitions in 9 ms returned []
Running 1200 sub problems to find dead transitions.
[2024-05-27 23:02:01] [INFO ] Flow matrix only has 1180 transitions (discarded 24 similar events)
[2024-05-27 23:02:01] [INFO ] Invariant cache hit.
[2024-05-27 23:02:01] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/372 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-27 23:02:15] [INFO ] Deduced a trap composed of 48 places in 155 ms of which 4 ms to minimize.
[2024-05-27 23:02:16] [INFO ] Deduced a trap composed of 48 places in 83 ms of which 1 ms to minimize.
[2024-05-27 23:02:16] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 1 ms to minimize.
[2024-05-27 23:02:16] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 1 ms to minimize.
[2024-05-27 23:02:16] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 13 ms to minimize.
[2024-05-27 23:02:16] [INFO ] Deduced a trap composed of 157 places in 362 ms of which 3 ms to minimize.
[2024-05-27 23:02:17] [INFO ] Deduced a trap composed of 147 places in 334 ms of which 3 ms to minimize.
[2024-05-27 23:02:17] [INFO ] Deduced a trap composed of 48 places in 56 ms of which 1 ms to minimize.
[2024-05-27 23:02:27] [INFO ] Deduced a trap composed of 120 places in 350 ms of which 3 ms to minimize.
[2024-05-27 23:02:27] [INFO ] Deduced a trap composed of 133 places in 218 ms of which 2 ms to minimize.
[2024-05-27 23:02:27] [INFO ] Deduced a trap composed of 181 places in 280 ms of which 2 ms to minimize.
[2024-05-27 23:02:28] [INFO ] Deduced a trap composed of 61 places in 315 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/372 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-27 23:02:31] [INFO ] Deduced a trap composed of 210 places in 281 ms of which 2 ms to minimize.
[2024-05-27 23:02:36] [INFO ] Deduced a trap composed of 27 places in 200 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 372/1556 variables, and 50 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30072 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/376 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/372 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/372 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-27 23:02:50] [INFO ] Deduced a trap composed of 18 places in 247 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/372 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/1556 variables, and 51 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/376 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 15/15 constraints]
After SMT, in 65743ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 65761ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 116818 ms. Remains : 376/376 places, 1204/1204 transitions.
Treatment of property PolyORBLF-COL-S04J04T06-LTLFireability-08 finished in 376183 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 U (G(!p0)||(!p0&&G(!p1))))))'
Support contains 36 out of 544 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 544/544 places, 1372/1372 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 544 transition count 1324
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 496 transition count 1324
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 96 place count 496 transition count 1294
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 156 place count 466 transition count 1294
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 162 place count 460 transition count 1288
Iterating global reduction 2 with 6 rules applied. Total rules applied 168 place count 460 transition count 1288
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 276 place count 406 transition count 1234
Applied a total of 276 rules in 53 ms. Remains 406 /544 variables (removed 138) and now considering 1234/1372 (removed 138) transitions.
Running 1230 sub problems to find dead transitions.
[2024-05-27 23:03:07] [INFO ] Flow matrix only has 1210 transitions (discarded 24 similar events)
// Phase 1: matrix 1210 rows 406 cols
[2024-05-27 23:03:07] [INFO ] Computed 40 invariants in 16 ms
[2024-05-27 23:03:07] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
[2024-05-27 23:03:23] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 1 ms to minimize.
[2024-05-27 23:03:31] [INFO ] Deduced a trap composed of 129 places in 162 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 9.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 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 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 2.0)
(s93 2.0)
(s94 2.0)
(s95 2.0)
(s96 2.0)
(s97 2.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 9.0)
(s105 1.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 402/1616 variables, and 33 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 11/14 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/406 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
[2024-05-27 23:03:40] [INFO ] Deduced a trap composed of 53 places in 280 ms of which 3 ms to minimize.
[2024-05-27 23:03:40] [INFO ] Deduced a trap composed of 53 places in 93 ms of which 1 ms to minimize.
[2024-05-27 23:03:40] [INFO ] Deduced a trap composed of 53 places in 53 ms of which 1 ms to minimize.
[2024-05-27 23:03:41] [INFO ] Deduced a trap composed of 33 places in 212 ms of which 2 ms to minimize.
[2024-05-27 23:03:41] [INFO ] Deduced a trap composed of 139 places in 206 ms of which 2 ms to minimize.
[2024-05-27 23:03:41] [INFO ] Deduced a trap composed of 42 places in 202 ms of which 2 ms to minimize.
[2024-05-27 23:03:41] [INFO ] Deduced a trap composed of 125 places in 213 ms of which 2 ms to minimize.
[2024-05-27 23:03:42] [INFO ] Deduced a trap composed of 53 places in 69 ms of which 1 ms to minimize.
[2024-05-27 23:03:42] [INFO ] Deduced a trap composed of 53 places in 87 ms of which 1 ms to minimize.
[2024-05-27 23:03:43] [INFO ] Deduced a trap composed of 53 places in 39 ms of which 1 ms to minimize.
[2024-05-27 23:03:46] [INFO ] Deduced a trap composed of 146 places in 201 ms of which 2 ms to minimize.
[2024-05-27 23:03:46] [INFO ] Deduced a trap composed of 149 places in 202 ms of which 2 ms to minimize.
[2024-05-27 23:03:46] [INFO ] Deduced a trap composed of 149 places in 180 ms of which 2 ms to minimize.
[2024-05-27 23:03:46] [INFO ] Deduced a trap composed of 123 places in 282 ms of which 2 ms to minimize.
[2024-05-27 23:03:47] [INFO ] Deduced a trap composed of 136 places in 269 ms of which 2 ms to minimize.
[2024-05-27 23:03:47] [INFO ] Deduced a trap composed of 127 places in 278 ms of which 2 ms to minimize.
[2024-05-27 23:03:47] [INFO ] Deduced a trap composed of 146 places in 260 ms of which 3 ms to minimize.
[2024-05-27 23:03:47] [INFO ] Deduced a trap composed of 148 places in 225 ms of which 2 ms to minimize.
[2024-05-27 23:03:48] [INFO ] Deduced a trap composed of 133 places in 204 ms of which 4 ms to minimize.
[2024-05-27 23:03:48] [INFO ] Deduced a trap composed of 122 places in 305 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 402/1616 variables, and 53 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/14 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/406 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 22/22 constraints]
After SMT, in 46046ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 46058ms
[2024-05-27 23:03:53] [INFO ] Flow matrix only has 1210 transitions (discarded 24 similar events)
[2024-05-27 23:03:53] [INFO ] Invariant cache hit.
[2024-05-27 23:03:54] [INFO ] Implicit Places using invariants in 477 ms returned []
[2024-05-27 23:03:54] [INFO ] Flow matrix only has 1210 transitions (discarded 24 similar events)
[2024-05-27 23:03:54] [INFO ] Invariant cache hit.
[2024-05-27 23:03:54] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 23:03:59] [INFO ] Implicit Places using invariants and state equation in 4741 ms returned []
Implicit Place search using SMT with State Equation took 5227 ms to find 0 implicit places.
[2024-05-27 23:03:59] [INFO ] Redundant transitions in 20 ms returned []
Running 1230 sub problems to find dead transitions.
[2024-05-27 23:03:59] [INFO ] Flow matrix only has 1210 transitions (discarded 24 similar events)
[2024-05-27 23:03:59] [INFO ] Invariant cache hit.
[2024-05-27 23:03:59] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
[2024-05-27 23:04:14] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-05-27 23:04:27] [INFO ] Deduced a trap composed of 136 places in 129 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 402/1616 variables, and 33 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 11/14 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/406 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
[2024-05-27 23:04:43] [INFO ] Deduced a trap composed of 39 places in 230 ms of which 2 ms to minimize.
[2024-05-27 23:04:43] [INFO ] Deduced a trap composed of 63 places in 232 ms of which 3 ms to minimize.
[2024-05-27 23:04:43] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 1 ms to minimize.
[2024-05-27 23:04:44] [INFO ] Deduced a trap composed of 53 places in 71 ms of which 1 ms to minimize.
[2024-05-27 23:04:44] [INFO ] Deduced a trap composed of 53 places in 72 ms of which 1 ms to minimize.
[2024-05-27 23:04:47] [INFO ] Deduced a trap composed of 47 places in 285 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
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 TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 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 TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 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 TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 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 TDEAD700 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD705 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 TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
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 TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 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
At refinement iteration 5 (OVERLAPS) 3/405 variables, 3/42 constraints. Problems are: Problem set: 252 solved, 978 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 5/47 constraints. Problems are: Problem set: 252 solved, 978 unsolved
[2024-05-27 23:05:01] [INFO ] Deduced a trap composed of 53 places in 63 ms of which 1 ms to minimize.
[2024-05-27 23:05:01] [INFO ] Deduced a trap composed of 53 places in 58 ms of which 1 ms to minimize.
[2024-05-27 23:05:01] [INFO ] Deduced a trap composed of 53 places in 57 ms of which 1 ms to minimize.
[2024-05-27 23:05:01] [INFO ] Deduced a trap composed of 189 places in 308 ms of which 3 ms to minimize.
[2024-05-27 23:05:01] [INFO ] Deduced a trap composed of 172 places in 317 ms of which 3 ms to minimize.
[2024-05-27 23:05:02] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 405/1616 variables, and 53 constraints, problems are : Problem set: 252 solved, 978 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/406 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 14/14 constraints]
After SMT, in 66499ms problems are : Problem set: 252 solved, 978 unsolved
Search for dead transitions found 252 dead transitions in 66520ms
Found 252 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 252 transitions
Dead transitions reduction (with SMT) removed 252 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 406/544 places, 982/1372 transitions.
Applied a total of 0 rules in 30 ms. Remains 406 /406 variables (removed 0) and now considering 982/982 (removed 0) transitions.
[2024-05-27 23:05:05] [INFO ] Redundant transitions in 15 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 117947 ms. Remains : 406/544 places, 982/1372 transitions.
Stuttering acceptance computed with spot in 121 ms :[p0, (AND p1 p0)]
Running random walk in product with property : PolyORBLF-COL-S04J04T06-LTLFireability-09
Product exploration explored 100000 steps with 8 reset in 935 ms.
Stack based approach found an accepted trace after 1297 steps with 0 reset with depth 1298 and stack size 1298 in 13 ms.
FORMULA PolyORBLF-COL-S04J04T06-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-COL-S04J04T06-LTLFireability-09 finished in 119065 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0&&X(X(X(G(p1))))) U X(!p2))))'
Support contains 36 out of 544 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 544/544 places, 1372/1372 transitions.
Applied a total of 0 rules in 11 ms. Remains 544 /544 variables (removed 0) and now considering 1372/1372 (removed 0) transitions.
Running 1368 sub problems to find dead transitions.
[2024-05-27 23:05:06] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
// Phase 1: matrix 1348 rows 544 cols
[2024-05-27 23:05:06] [INFO ] Computed 40 invariants in 42 ms
[2024-05-27 23:05:06] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/540 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-05-27 23:05:24] [INFO ] Deduced a trap composed of 76 places in 72 ms of which 1 ms to minimize.
[2024-05-27 23:05:24] [INFO ] Deduced a trap composed of 76 places in 71 ms of which 1 ms to minimize.
[2024-05-27 23:05:24] [INFO ] Deduced a trap composed of 76 places in 57 ms of which 1 ms to minimize.
[2024-05-27 23:05:24] [INFO ] Deduced a trap composed of 76 places in 59 ms of which 1 ms to minimize.
[2024-05-27 23:05:24] [INFO ] Deduced a trap composed of 76 places in 51 ms of which 1 ms to minimize.
[2024-05-27 23:05:25] [INFO ] Deduced a trap composed of 376 places in 358 ms of which 4 ms to minimize.
[2024-05-27 23:05:25] [INFO ] Deduced a trap composed of 299 places in 303 ms of which 3 ms to minimize.
[2024-05-27 23:05:26] [INFO ] Deduced a trap composed of 312 places in 267 ms of which 3 ms to minimize.
[2024-05-27 23:05:26] [INFO ] Deduced a trap composed of 291 places in 324 ms of which 4 ms to minimize.
[2024-05-27 23:05:26] [INFO ] Deduced a trap composed of 137 places in 309 ms of which 4 ms to minimize.
[2024-05-27 23:05:27] [INFO ] Deduced a trap composed of 155 places in 286 ms of which 4 ms to minimize.
[2024-05-27 23:05:27] [INFO ] Deduced a trap composed of 76 places in 55 ms of which 1 ms to minimize.
[2024-05-27 23:05:27] [INFO ] Deduced a trap composed of 319 places in 341 ms of which 4 ms to minimize.
[2024-05-27 23:05:29] [INFO ] Deduced a trap composed of 324 places in 312 ms of which 3 ms to minimize.
[2024-05-27 23:05:29] [INFO ] Deduced a trap composed of 323 places in 310 ms of which 3 ms to minimize.
[2024-05-27 23:05:29] [INFO ] Deduced a trap composed of 15 places in 301 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 540/1892 variables, and 52 constraints, problems are : Problem set: 0 solved, 1368 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 22/25 constraints, State Equation: 0/544 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1368/1368 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/540 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/540 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-05-27 23:05:39] [INFO ] Deduced a trap composed of 39 places in 248 ms of which 3 ms to minimize.
[2024-05-27 23:05:41] [INFO ] Deduced a trap composed of 331 places in 327 ms of which 4 ms to minimize.
[2024-05-27 23:05:41] [INFO ] Deduced a trap composed of 267 places in 325 ms of which 4 ms to minimize.
[2024-05-27 23:05:43] [INFO ] Deduced a trap composed of 314 places in 302 ms of which 4 ms to minimize.
[2024-05-27 23:05:43] [INFO ] Deduced a trap composed of 243 places in 234 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 540/1892 variables, and 57 constraints, problems are : Problem set: 0 solved, 1368 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 22/25 constraints, State Equation: 0/544 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1368 constraints, Known Traps: 21/21 constraints]
After SMT, in 46648ms problems are : Problem set: 0 solved, 1368 unsolved
Search for dead transitions found 0 dead transitions in 46671ms
[2024-05-27 23:05:53] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
[2024-05-27 23:05:53] [INFO ] Invariant cache hit.
[2024-05-27 23:05:53] [INFO ] Implicit Places using invariants in 399 ms returned []
[2024-05-27 23:05:53] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
[2024-05-27 23:05:53] [INFO ] Invariant cache hit.
[2024-05-27 23:05:54] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 23:06:04] [INFO ] Implicit Places using invariants and state equation in 11111 ms returned []
Implicit Place search using SMT with State Equation took 11513 ms to find 0 implicit places.
Running 1368 sub problems to find dead transitions.
[2024-05-27 23:06:05] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
[2024-05-27 23:06:05] [INFO ] Invariant cache hit.
[2024-05-27 23:06:05] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/540 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-05-27 23:06:22] [INFO ] Deduced a trap composed of 76 places in 67 ms of which 1 ms to minimize.
[2024-05-27 23:06:23] [INFO ] Deduced a trap composed of 76 places in 234 ms of which 2 ms to minimize.
[2024-05-27 23:06:24] [INFO ] Deduced a trap composed of 59 places in 231 ms of which 2 ms to minimize.
[2024-05-27 23:06:24] [INFO ] Deduced a trap composed of 76 places in 54 ms of which 1 ms to minimize.
[2024-05-27 23:06:24] [INFO ] Deduced a trap composed of 76 places in 63 ms of which 2 ms to minimize.
[2024-05-27 23:06:24] [INFO ] Deduced a trap composed of 76 places in 52 ms of which 1 ms to minimize.
[2024-05-27 23:06:25] [INFO ] Deduced a trap composed of 76 places in 72 ms of which 1 ms to minimize.
[2024-05-27 23:06:28] [INFO ] Deduced a trap composed of 336 places in 382 ms of which 4 ms to minimize.
[2024-05-27 23:06:28] [INFO ] Deduced a trap composed of 308 places in 368 ms of which 4 ms to minimize.
[2024-05-27 23:06:28] [INFO ] Deduced a trap composed of 335 places in 368 ms of which 4 ms to minimize.
[2024-05-27 23:06:29] [INFO ] Deduced a trap composed of 318 places in 350 ms of which 4 ms to minimize.
[2024-05-27 23:06:29] [INFO ] Deduced a trap composed of 329 places in 323 ms of which 4 ms to minimize.
[2024-05-27 23:06:29] [INFO ] Deduced a trap composed of 15 places in 310 ms of which 3 ms to minimize.
[2024-05-27 23:06:39] [INFO ] Deduced a trap composed of 278 places in 383 ms of which 4 ms to minimize.
[2024-05-27 23:06:39] [INFO ] Deduced a trap composed of 273 places in 357 ms of which 5 ms to minimize.
[2024-05-27 23:06:40] [INFO ] Deduced a trap composed of 372 places in 338 ms of which 4 ms to minimize.
[2024-05-27 23:06:40] [INFO ] Deduced a trap composed of 278 places in 298 ms of which 3 ms to minimize.
SMT process timed out in 35630ms, After SMT, problems are : Problem set: 0 solved, 1368 unsolved
Search for dead transitions found 0 dead transitions in 35646ms
Finished structural reductions in LTL mode , in 1 iterations and 93848 ms. Remains : 544/544 places, 1372/1372 transitions.
Stuttering acceptance computed with spot in 272 ms :[p2, p2, p2, p2, true, (NOT p1), (NOT p1)]
Running random walk in product with property : PolyORBLF-COL-S04J04T06-LTLFireability-10
Product exploration explored 100000 steps with 33333 reset in 716 ms.
Product exploration explored 100000 steps with 33333 reset in 695 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 p2) (NOT p1)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 26 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S04J04T06-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S04J04T06-LTLFireability-10 finished in 95602 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(G(p0))&&F(p1))))'
Support contains 57 out of 544 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 544/544 places, 1372/1372 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 544 transition count 1318
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 490 transition count 1318
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 108 place count 490 transition count 1282
Deduced a syphon composed of 36 places in 2 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 180 place count 454 transition count 1282
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 186 place count 448 transition count 1276
Iterating global reduction 2 with 6 rules applied. Total rules applied 192 place count 448 transition count 1276
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 312 place count 388 transition count 1216
Applied a total of 312 rules in 95 ms. Remains 388 /544 variables (removed 156) and now considering 1216/1372 (removed 156) transitions.
Running 1212 sub problems to find dead transitions.
[2024-05-27 23:06:42] [INFO ] Flow matrix only has 1192 transitions (discarded 24 similar events)
// Phase 1: matrix 1192 rows 388 cols
[2024-05-27 23:06:42] [INFO ] Computed 40 invariants in 23 ms
[2024-05-27 23:06:42] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
[2024-05-27 23:06:57] [INFO ] Deduced a trap composed of 50 places in 93 ms of which 1 ms to minimize.
[2024-05-27 23:06:57] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 1 ms to minimize.
[2024-05-27 23:06:57] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 1 ms to minimize.
[2024-05-27 23:06:57] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 0 ms to minimize.
[2024-05-27 23:06:57] [INFO ] Deduced a trap composed of 50 places in 40 ms of which 0 ms to minimize.
[2024-05-27 23:06:58] [INFO ] Deduced a trap composed of 182 places in 317 ms of which 3 ms to minimize.
[2024-05-27 23:06:58] [INFO ] Deduced a trap composed of 171 places in 416 ms of which 3 ms to minimize.
[2024-05-27 23:06:59] [INFO ] Deduced a trap composed of 175 places in 306 ms of which 3 ms to minimize.
[2024-05-27 23:06:59] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 384/1580 variables, and 45 constraints, problems are : Problem set: 0 solved, 1212 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/388 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1212/1212 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
[2024-05-27 23:07:13] [INFO ] Deduced a trap composed of 29 places in 192 ms of which 1 ms to minimize.
[2024-05-27 23:07:23] [INFO ] Deduced a trap composed of 59 places in 241 ms of which 3 ms to minimize.
[2024-05-27 23:07:24] [INFO ] Deduced a trap composed of 15 places in 307 ms of which 2 ms to minimize.
[2024-05-27 23:07:28] [INFO ] Deduced a trap composed of 170 places in 344 ms of which 3 ms to minimize.
[2024-05-27 23:07:28] [INFO ] Deduced a trap composed of 144 places in 321 ms of which 2 ms to minimize.
[2024-05-27 23:07:29] [INFO ] Deduced a trap composed of 164 places in 307 ms of which 3 ms to minimize.
SMT process timed out in 46875ms, After SMT, problems are : Problem set: 0 solved, 1212 unsolved
Search for dead transitions found 0 dead transitions in 46902ms
[2024-05-27 23:07:29] [INFO ] Flow matrix only has 1192 transitions (discarded 24 similar events)
[2024-05-27 23:07:29] [INFO ] Invariant cache hit.
[2024-05-27 23:07:29] [INFO ] Implicit Places using invariants in 366 ms returned []
[2024-05-27 23:07:29] [INFO ] Flow matrix only has 1192 transitions (discarded 24 similar events)
[2024-05-27 23:07:29] [INFO ] Invariant cache hit.
[2024-05-27 23:07:30] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 23:07:34] [INFO ] Implicit Places using invariants and state equation in 5071 ms returned []
Implicit Place search using SMT with State Equation took 5465 ms to find 0 implicit places.
[2024-05-27 23:07:34] [INFO ] Redundant transitions in 10 ms returned []
Running 1212 sub problems to find dead transitions.
[2024-05-27 23:07:34] [INFO ] Flow matrix only has 1192 transitions (discarded 24 similar events)
[2024-05-27 23:07:34] [INFO ] Invariant cache hit.
[2024-05-27 23:07:34] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
[2024-05-27 23:07:49] [INFO ] Deduced a trap composed of 50 places in 125 ms of which 2 ms to minimize.
[2024-05-27 23:07:49] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 1 ms to minimize.
[2024-05-27 23:07:49] [INFO ] Deduced a trap composed of 50 places in 46 ms of which 1 ms to minimize.
[2024-05-27 23:07:49] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 1 ms to minimize.
[2024-05-27 23:07:49] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 2 ms to minimize.
[2024-05-27 23:07:50] [INFO ] Deduced a trap composed of 172 places in 325 ms of which 3 ms to minimize.
[2024-05-27 23:07:50] [INFO ] Deduced a trap composed of 182 places in 336 ms of which 3 ms to minimize.
[2024-05-27 23:07:51] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 1 ms to minimize.
[2024-05-27 23:08:04] [INFO ] Deduced a trap composed of 166 places in 280 ms of which 3 ms to minimize.
[2024-05-27 23:08:04] [INFO ] Deduced a trap composed of 15 places in 287 ms of which 3 ms to minimize.
[2024-05-27 23:08:05] [INFO ] Deduced a trap composed of 166 places in 329 ms of which 2 ms to minimize.
[2024-05-27 23:08:05] [INFO ] Deduced a trap composed of 144 places in 296 ms of which 3 ms to minimize.
[2024-05-27 23:08:06] [INFO ] Deduced a trap composed of 140 places in 282 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
[2024-05-27 23:08:10] [INFO ] Deduced a trap composed of 178 places in 294 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 384/1580 variables, and 50 constraints, problems are : Problem set: 0 solved, 1212 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/388 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1212/1212 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 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 TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 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 TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 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 TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem 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 TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD699 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 TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 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 TDEAD778 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD789 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 TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD801 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 TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 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
At refinement iteration 4 (OVERLAPS) 3/387 variables, 3/53 constraints. Problems are: Problem set: 252 solved, 960 unsolved
[2024-05-27 23:08:38] [INFO ] Deduced a trap composed of 44 places in 238 ms of which 3 ms to minimize.
[2024-05-27 23:08:40] [INFO ] Deduced a trap composed of 59 places in 287 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 2/55 constraints. Problems are: Problem set: 252 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 387/1580 variables, and 55 constraints, problems are : Problem set: 252 solved, 960 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/388 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1212 constraints, Known Traps: 16/16 constraints]
After SMT, in 66269ms problems are : Problem set: 252 solved, 960 unsolved
Search for dead transitions found 252 dead transitions in 66288ms
Found 252 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 252 transitions
Dead transitions reduction (with SMT) removed 252 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 388/544 places, 964/1372 transitions.
Applied a total of 0 rules in 23 ms. Remains 388 /388 variables (removed 0) and now considering 964/964 (removed 0) transitions.
[2024-05-27 23:08:41] [INFO ] Redundant transitions in 12 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 118823 ms. Remains : 388/544 places, 964/1372 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PolyORBLF-COL-S04J04T06-LTLFireability-11
Stuttering criterion allowed to conclude after 9101 steps with 2 reset in 94 ms.
FORMULA PolyORBLF-COL-S04J04T06-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S04J04T06-LTLFireability-11 finished in 119135 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p1)||p0)))'
Support contains 17 out of 544 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 544/544 places, 1372/1372 transitions.
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 544 transition count 1330
Reduce places removed 42 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 48 rules applied. Total rules applied 90 place count 502 transition count 1324
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 96 place count 496 transition count 1324
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 96 place count 496 transition count 1264
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 216 place count 436 transition count 1264
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 222 place count 430 transition count 1258
Iterating global reduction 3 with 6 rules applied. Total rules applied 228 place count 430 transition count 1258
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 312 place count 388 transition count 1216
Applied a total of 312 rules in 83 ms. Remains 388 /544 variables (removed 156) and now considering 1216/1372 (removed 156) transitions.
Running 1212 sub problems to find dead transitions.
[2024-05-27 23:08:41] [INFO ] Flow matrix only has 1192 transitions (discarded 24 similar events)
// Phase 1: matrix 1192 rows 388 cols
[2024-05-27 23:08:41] [INFO ] Computed 40 invariants in 37 ms
[2024-05-27 23:08:41] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 24/35 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
[2024-05-27 23:09:02] [INFO ] Deduced a trap composed of 138 places in 256 ms of which 3 ms to minimize.
[2024-05-27 23:09:03] [INFO ] Deduced a trap composed of 36 places in 294 ms of which 3 ms to minimize.
[2024-05-27 23:09:06] [INFO ] Deduced a trap composed of 110 places in 245 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 384/1580 variables, and 38 constraints, problems are : Problem set: 0 solved, 1212 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/388 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1212/1212 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 24/35 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
[2024-05-27 23:09:10] [INFO ] Deduced a trap composed of 92 places in 237 ms of which 3 ms to minimize.
[2024-05-27 23:09:10] [INFO ] Deduced a trap composed of 89 places in 212 ms of which 2 ms to minimize.
[2024-05-27 23:09:10] [INFO ] Deduced a trap composed of 89 places in 237 ms of which 3 ms to minimize.
[2024-05-27 23:09:10] [INFO ] Deduced a trap composed of 76 places in 240 ms of which 2 ms to minimize.
[2024-05-27 23:09:12] [INFO ] Deduced a trap composed of 144 places in 212 ms of which 3 ms to minimize.
[2024-05-27 23:09:12] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 3 ms to minimize.
[2024-05-27 23:09:13] [INFO ] Deduced a trap composed of 50 places in 144 ms of which 1 ms to minimize.
[2024-05-27 23:09:13] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 1 ms to minimize.
[2024-05-27 23:09:19] [INFO ] Deduced a trap composed of 33 places in 178 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 9/47 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 384/1580 variables, and 47 constraints, problems are : Problem set: 0 solved, 1212 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/388 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1212 constraints, Known Traps: 12/12 constraints]
After SMT, in 46552ms problems are : Problem set: 0 solved, 1212 unsolved
Search for dead transitions found 0 dead transitions in 46573ms
[2024-05-27 23:09:28] [INFO ] Flow matrix only has 1192 transitions (discarded 24 similar events)
[2024-05-27 23:09:28] [INFO ] Invariant cache hit.
[2024-05-27 23:09:28] [INFO ] Implicit Places using invariants in 413 ms returned []
[2024-05-27 23:09:28] [INFO ] Flow matrix only has 1192 transitions (discarded 24 similar events)
[2024-05-27 23:09:28] [INFO ] Invariant cache hit.
[2024-05-27 23:09:28] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 23:09:32] [INFO ] Implicit Places using invariants and state equation in 3642 ms returned []
Implicit Place search using SMT with State Equation took 4058 ms to find 0 implicit places.
[2024-05-27 23:09:32] [INFO ] Redundant transitions in 9 ms returned []
Running 1212 sub problems to find dead transitions.
[2024-05-27 23:09:32] [INFO ] Flow matrix only has 1192 transitions (discarded 24 similar events)
[2024-05-27 23:09:32] [INFO ] Invariant cache hit.
[2024-05-27 23:09:32] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 24/35 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
[2024-05-27 23:09:51] [INFO ] Deduced a trap composed of 36 places in 258 ms of which 3 ms to minimize.
[2024-05-27 23:09:54] [INFO ] Deduced a trap composed of 110 places in 232 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
[2024-05-27 23:09:56] [INFO ] Deduced a trap composed of 74 places in 251 ms of which 3 ms to minimize.
[2024-05-27 23:10:03] [INFO ] Deduced a trap composed of 138 places in 251 ms of which 3 ms to minimize.
[2024-05-27 23:10:03] [INFO ] Deduced a trap composed of 57 places in 177 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 384/1580 variables, and 40 constraints, problems are : Problem set: 0 solved, 1212 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/388 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1212/1212 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 24/35 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
[2024-05-27 23:10:11] [INFO ] Deduced a trap composed of 50 places in 186 ms of which 3 ms to minimize.
[2024-05-27 23:10:11] [INFO ] Deduced a trap composed of 50 places in 188 ms of which 2 ms to minimize.
[2024-05-27 23:10:11] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
[2024-05-27 23:10:25] [INFO ] Deduced a trap composed of 50 places in 129 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
[2024-05-27 23:10:37] [INFO ] Deduced a trap composed of 50 places in 99 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 384/1580 variables, and 45 constraints, problems are : Problem set: 0 solved, 1212 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/388 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1212 constraints, Known Traps: 10/10 constraints]
After SMT, in 65809ms problems are : Problem set: 0 solved, 1212 unsolved
Search for dead transitions found 0 dead transitions in 65824ms
Starting structural reductions in SI_LTL mode, iteration 1 : 388/544 places, 1216/1372 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 116568 ms. Remains : 388/544 places, 1216/1372 transitions.
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-COL-S04J04T06-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 755 ms.
Product exploration explored 100000 steps with 50000 reset in 747 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 41 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S04J04T06-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S04J04T06-LTLFireability-12 finished in 118216 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 31 out of 544 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 544/544 places, 1372/1372 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 544 transition count 1318
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 490 transition count 1318
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 108 place count 490 transition count 1258
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 228 place count 430 transition count 1258
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 234 place count 424 transition count 1252
Iterating global reduction 2 with 6 rules applied. Total rules applied 240 place count 424 transition count 1252
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 360 place count 364 transition count 1192
Applied a total of 360 rules in 50 ms. Remains 364 /544 variables (removed 180) and now considering 1192/1372 (removed 180) transitions.
Running 1188 sub problems to find dead transitions.
[2024-05-27 23:10:39] [INFO ] Flow matrix only has 1168 transitions (discarded 24 similar events)
// Phase 1: matrix 1168 rows 364 cols
[2024-05-27 23:10:39] [INFO ] Computed 40 invariants in 16 ms
[2024-05-27 23:10:39] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
[2024-05-27 23:10:53] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 1 ms to minimize.
[2024-05-27 23:10:53] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
[2024-05-27 23:10:53] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 0 ms to minimize.
[2024-05-27 23:10:53] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 0 ms to minimize.
[2024-05-27 23:10:53] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
[2024-05-27 23:10:53] [INFO ] Deduced a trap composed of 155 places in 299 ms of which 2 ms to minimize.
[2024-05-27 23:10:54] [INFO ] Deduced a trap composed of 165 places in 263 ms of which 3 ms to minimize.
[2024-05-27 23:10:54] [INFO ] Deduced a trap composed of 209 places in 248 ms of which 3 ms to minimize.
[2024-05-27 23:10:54] [INFO ] Deduced a trap composed of 151 places in 247 ms of which 3 ms to minimize.
[2024-05-27 23:10:55] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 1 ms to minimize.
[2024-05-27 23:10:56] [INFO ] Deduced a trap composed of 178 places in 251 ms of which 2 ms to minimize.
[2024-05-27 23:10:57] [INFO ] Deduced a trap composed of 170 places in 386 ms of which 3 ms to minimize.
[2024-05-27 23:10:57] [INFO ] Deduced a trap composed of 15 places in 290 ms of which 2 ms to minimize.
[2024-05-27 23:11:02] [INFO ] Deduced a trap composed of 45 places in 155 ms of which 1 ms to minimize.
[2024-05-27 23:11:05] [INFO ] Deduced a trap composed of 92 places in 269 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 360/1532 variables, and 51 constraints, problems are : Problem set: 0 solved, 1188 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 25/28 constraints, State Equation: 0/364 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1188/1188 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
[2024-05-27 23:11:08] [INFO ] Deduced a trap composed of 57 places in 273 ms of which 3 ms to minimize.
[2024-05-27 23:11:19] [INFO ] Deduced a trap composed of 120 places in 330 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 360/1532 variables, and 53 constraints, problems are : Problem set: 0 solved, 1188 unsolved in 20071 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 25/28 constraints, State Equation: 0/364 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1188 constraints, Known Traps: 17/17 constraints]
After SMT, in 46165ms problems are : Problem set: 0 solved, 1188 unsolved
Search for dead transitions found 0 dead transitions in 46182ms
[2024-05-27 23:11:25] [INFO ] Flow matrix only has 1168 transitions (discarded 24 similar events)
[2024-05-27 23:11:25] [INFO ] Invariant cache hit.
[2024-05-27 23:11:26] [INFO ] Implicit Places using invariants in 422 ms returned []
[2024-05-27 23:11:26] [INFO ] Flow matrix only has 1168 transitions (discarded 24 similar events)
[2024-05-27 23:11:26] [INFO ] Invariant cache hit.
[2024-05-27 23:11:26] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 23:11:33] [INFO ] Implicit Places using invariants and state equation in 6885 ms returned []
Implicit Place search using SMT with State Equation took 7345 ms to find 0 implicit places.
[2024-05-27 23:11:33] [INFO ] Redundant transitions in 14 ms returned []
Running 1188 sub problems to find dead transitions.
[2024-05-27 23:11:33] [INFO ] Flow matrix only has 1168 transitions (discarded 24 similar events)
[2024-05-27 23:11:33] [INFO ] Invariant cache hit.
[2024-05-27 23:11:33] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
[2024-05-27 23:11:46] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 1 ms to minimize.
[2024-05-27 23:11:46] [INFO ] Deduced a trap composed of 46 places in 63 ms of which 1 ms to minimize.
[2024-05-27 23:11:46] [INFO ] Deduced a trap composed of 46 places in 63 ms of which 0 ms to minimize.
[2024-05-27 23:11:46] [INFO ] Deduced a trap composed of 46 places in 87 ms of which 1 ms to minimize.
[2024-05-27 23:11:46] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 1 ms to minimize.
[2024-05-27 23:11:47] [INFO ] Deduced a trap composed of 168 places in 347 ms of which 2 ms to minimize.
[2024-05-27 23:11:47] [INFO ] Deduced a trap composed of 177 places in 330 ms of which 2 ms to minimize.
[2024-05-27 23:11:48] [INFO ] Deduced a trap composed of 183 places in 399 ms of which 2 ms to minimize.
[2024-05-27 23:11:48] [INFO ] Deduced a trap composed of 156 places in 264 ms of which 2 ms to minimize.
[2024-05-27 23:11:48] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 1 ms to minimize.
[2024-05-27 23:11:49] [INFO ] Deduced a trap composed of 138 places in 257 ms of which 1 ms to minimize.
[2024-05-27 23:11:57] [INFO ] Deduced a trap composed of 145 places in 332 ms of which 3 ms to minimize.
[2024-05-27 23:11:58] [INFO ] Deduced a trap composed of 103 places in 233 ms of which 2 ms to minimize.
[2024-05-27 23:11:59] [INFO ] Deduced a trap composed of 153 places in 220 ms of which 2 ms to minimize.
[2024-05-27 23:11:59] [INFO ] Deduced a trap composed of 3 places in 233 ms of which 2 ms to minimize.
[2024-05-27 23:12:00] [INFO ] Deduced a trap composed of 15 places in 192 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
[2024-05-27 23:12:02] [INFO ] Deduced a trap composed of 178 places in 329 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 360/1532 variables, and 53 constraints, problems are : Problem set: 0 solved, 1188 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 25/28 constraints, State Equation: 0/364 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1188/1188 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/361 variables, 1/54 constraints. Problems are: Problem set: 90 solved, 1098 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 361/1532 variables, and 54 constraints, problems are : Problem set: 90 solved, 1098 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 25/28 constraints, State Equation: 0/364 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1188 constraints, Known Traps: 17/17 constraints]
After SMT, in 66498ms problems are : Problem set: 90 solved, 1098 unsolved
Search for dead transitions found 90 dead transitions in 66515ms
Found 90 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 90 transitions
Dead transitions reduction (with SMT) removed 90 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 364/544 places, 1102/1372 transitions.
Applied a total of 0 rules in 27 ms. Remains 364 /364 variables (removed 0) and now considering 1102/1102 (removed 0) transitions.
[2024-05-27 23:12:39] [INFO ] Redundant transitions in 15 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 120202 ms. Remains : 364/544 places, 1102/1372 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J04T06-LTLFireability-13
Stuttering criterion allowed to conclude after 1202 steps with 0 reset in 18 ms.
FORMULA PolyORBLF-COL-S04J04T06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S04J04T06-LTLFireability-13 finished in 120369 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 12 out of 544 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 544/544 places, 1372/1372 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 544 transition count 1324
Reduce places removed 48 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 54 rules applied. Total rules applied 102 place count 496 transition count 1318
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 108 place count 490 transition count 1318
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 108 place count 490 transition count 1258
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 228 place count 430 transition count 1258
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 234 place count 424 transition count 1252
Iterating global reduction 3 with 6 rules applied. Total rules applied 240 place count 424 transition count 1252
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 348 place count 370 transition count 1198
Applied a total of 348 rules in 102 ms. Remains 370 /544 variables (removed 174) and now considering 1198/1372 (removed 174) transitions.
Running 1194 sub problems to find dead transitions.
[2024-05-27 23:12:40] [INFO ] Flow matrix only has 1174 transitions (discarded 24 similar events)
// Phase 1: matrix 1174 rows 370 cols
[2024-05-27 23:12:40] [INFO ] Computed 40 invariants in 22 ms
[2024-05-27 23:12:40] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-27 23:12:56] [INFO ] Deduced a trap composed of 47 places in 80 ms of which 1 ms to minimize.
[2024-05-27 23:12:56] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 1 ms to minimize.
[2024-05-27 23:12:56] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 1 ms to minimize.
[2024-05-27 23:12:56] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 1 ms to minimize.
[2024-05-27 23:12:56] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 1 ms to minimize.
[2024-05-27 23:12:56] [INFO ] Deduced a trap composed of 155 places in 286 ms of which 3 ms to minimize.
[2024-05-27 23:12:57] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 1 ms to minimize.
[2024-05-27 23:13:00] [INFO ] Deduced a trap composed of 177 places in 316 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 366/1544 variables, and 44 constraints, problems are : Problem set: 0 solved, 1194 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/17 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/370 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1194/1194 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 8/44 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-27 23:13:10] [INFO ] Deduced a trap composed of 15 places in 265 ms of which 2 ms to minimize.
[2024-05-27 23:13:10] [INFO ] Deduced a trap composed of 161 places in 306 ms of which 2 ms to minimize.
[2024-05-27 23:13:10] [INFO ] Deduced a trap composed of 154 places in 262 ms of which 2 ms to minimize.
[2024-05-27 23:13:11] [INFO ] Deduced a trap composed of 153 places in 352 ms of which 2 ms to minimize.
[2024-05-27 23:13:12] [INFO ] Deduced a trap composed of 27 places in 220 ms of which 1 ms to minimize.
[2024-05-27 23:13:22] [INFO ] Deduced a trap composed of 120 places in 220 ms of which 2 ms to minimize.
[2024-05-27 23:13:23] [INFO ] Deduced a trap composed of 184 places in 244 ms of which 2 ms to minimize.
[2024-05-27 23:13:23] [INFO ] Deduced a trap composed of 115 places in 257 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/366 variables, 8/52 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 366/1544 variables, and 52 constraints, problems are : Problem set: 0 solved, 1194 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 14/17 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/370 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1194 constraints, Known Traps: 16/16 constraints]
After SMT, in 46495ms problems are : Problem set: 0 solved, 1194 unsolved
Search for dead transitions found 0 dead transitions in 46514ms
[2024-05-27 23:13:26] [INFO ] Flow matrix only has 1174 transitions (discarded 24 similar events)
[2024-05-27 23:13:26] [INFO ] Invariant cache hit.
[2024-05-27 23:13:27] [INFO ] Implicit Places using invariants in 359 ms returned []
[2024-05-27 23:13:27] [INFO ] Flow matrix only has 1174 transitions (discarded 24 similar events)
[2024-05-27 23:13:27] [INFO ] Invariant cache hit.
[2024-05-27 23:13:27] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 23:13:31] [INFO ] Implicit Places using invariants and state equation in 4128 ms returned []
Implicit Place search using SMT with State Equation took 4491 ms to find 0 implicit places.
[2024-05-27 23:13:31] [INFO ] Redundant transitions in 9 ms returned []
Running 1194 sub problems to find dead transitions.
[2024-05-27 23:13:31] [INFO ] Flow matrix only has 1174 transitions (discarded 24 similar events)
[2024-05-27 23:13:31] [INFO ] Invariant cache hit.
[2024-05-27 23:13:31] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-27 23:13:46] [INFO ] Deduced a trap composed of 47 places in 80 ms of which 2 ms to minimize.
[2024-05-27 23:13:46] [INFO ] Deduced a trap composed of 47 places in 86 ms of which 1 ms to minimize.
[2024-05-27 23:13:46] [INFO ] Deduced a trap composed of 47 places in 81 ms of which 1 ms to minimize.
[2024-05-27 23:13:46] [INFO ] Deduced a trap composed of 47 places in 79 ms of which 1 ms to minimize.
[2024-05-27 23:13:46] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 1 ms to minimize.
[2024-05-27 23:13:47] [INFO ] Deduced a trap composed of 143 places in 384 ms of which 3 ms to minimize.
[2024-05-27 23:13:47] [INFO ] Deduced a trap composed of 47 places in 324 ms of which 3 ms to minimize.
[2024-05-27 23:13:47] [INFO ] Deduced a trap composed of 186 places in 388 ms of which 2 ms to minimize.
[2024-05-27 23:13:58] [INFO ] Deduced a trap composed of 120 places in 293 ms of which 2 ms to minimize.
[2024-05-27 23:13:59] [INFO ] Deduced a trap composed of 126 places in 269 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 366/1544 variables, and 46 constraints, problems are : Problem set: 0 solved, 1194 unsolved in 30079 ms.
Refiners :[Positive P Invariants (semi-flows): 14/17 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/370 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1194/1194 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-27 23:14:13] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 1 ms to minimize.
[2024-05-27 23:14:25] [INFO ] Deduced a trap composed of 27 places in 228 ms of which 2 ms to minimize.
[2024-05-27 23:14:29] [INFO ] Deduced a trap composed of 184 places in 361 ms of which 2 ms to minimize.
[2024-05-27 23:14:30] [INFO ] Deduced a trap composed of 26 places in 264 ms of which 3 ms to minimize.
[2024-05-27 23:14:31] [INFO ] Deduced a trap composed of 57 places in 260 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/366 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 366/1544 variables, and 51 constraints, problems are : Problem set: 0 solved, 1194 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 14/17 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/370 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1194 constraints, Known Traps: 15/15 constraints]
After SMT, in 65493ms problems are : Problem set: 0 solved, 1194 unsolved
Search for dead transitions found 0 dead transitions in 65507ms
Starting structural reductions in SI_LTL mode, iteration 1 : 370/544 places, 1198/1372 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 116640 ms. Remains : 370/544 places, 1198/1372 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J04T06-LTLFireability-14
Product exploration explored 100000 steps with 6802 reset in 499 ms.
Product exploration explored 100000 steps with 6777 reset in 438 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p0)]
RANDOM walk for 60 steps (0 resets) in 5 ms. (10 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 185 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
[2024-05-27 23:14:38] [INFO ] Flow matrix only has 1174 transitions (discarded 24 similar events)
[2024-05-27 23:14:38] [INFO ] Invariant cache hit.
[2024-05-27 23:14:39] [INFO ] [Real]Absence check using 17 positive place invariants in 24 ms returned sat
[2024-05-27 23:14:39] [INFO ] [Real]Absence check using 17 positive and 23 generalized place invariants in 56 ms returned sat
[2024-05-27 23:14:40] [INFO ] [Real]Absence check using state equation in 1514 ms returned sat
[2024-05-27 23:14:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 23:14:41] [INFO ] [Nat]Absence check using 17 positive place invariants in 29 ms returned sat
[2024-05-27 23:14:41] [INFO ] [Nat]Absence check using 17 positive and 23 generalized place invariants in 95 ms returned sat
[2024-05-27 23:14:45] [INFO ] [Nat]Absence check using state equation in 3784 ms returned sat
[2024-05-27 23:14:45] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 23:14:45] [INFO ] [Nat]Added 120 Read/Feed constraints in 374 ms returned sat
[2024-05-27 23:14:45] [INFO ] Computed and/alt/rep : 810/3427/792 causal constraints (skipped 378 transitions) in 102 ms.
[2024-05-27 23:14:51] [INFO ] Added : 220 causal constraints over 44 iterations in 5982 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 12 out of 370 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 370/370 places, 1198/1198 transitions.
Applied a total of 0 rules in 21 ms. Remains 370 /370 variables (removed 0) and now considering 1198/1198 (removed 0) transitions.
Running 1194 sub problems to find dead transitions.
[2024-05-27 23:14:51] [INFO ] Flow matrix only has 1174 transitions (discarded 24 similar events)
[2024-05-27 23:14:51] [INFO ] Invariant cache hit.
[2024-05-27 23:14:51] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-27 23:15:05] [INFO ] Deduced a trap composed of 47 places in 137 ms of which 1 ms to minimize.
[2024-05-27 23:15:06] [INFO ] Deduced a trap composed of 47 places in 133 ms of which 1 ms to minimize.
[2024-05-27 23:15:06] [INFO ] Deduced a trap composed of 47 places in 77 ms of which 1 ms to minimize.
[2024-05-27 23:15:06] [INFO ] Deduced a trap composed of 47 places in 90 ms of which 1 ms to minimize.
[2024-05-27 23:15:06] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 1 ms to minimize.
[2024-05-27 23:15:06] [INFO ] Deduced a trap composed of 143 places in 418 ms of which 3 ms to minimize.
[2024-05-27 23:15:07] [INFO ] Deduced a trap composed of 47 places in 306 ms of which 2 ms to minimize.
[2024-05-27 23:15:07] [INFO ] Deduced a trap composed of 186 places in 286 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 366/1544 variables, and 44 constraints, problems are : Problem set: 0 solved, 1194 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/17 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/370 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1194/1194 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 8/44 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-27 23:15:23] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 1 ms to minimize.
[2024-05-27 23:15:24] [INFO ] Deduced a trap composed of 36 places in 153 ms of which 1 ms to minimize.
[2024-05-27 23:15:24] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 1 ms to minimize.
[2024-05-27 23:15:32] [INFO ] Deduced a trap composed of 120 places in 215 ms of which 3 ms to minimize.
[2024-05-27 23:15:33] [INFO ] Deduced a trap composed of 27 places in 160 ms of which 2 ms to minimize.
[2024-05-27 23:15:33] [INFO ] Deduced a trap composed of 117 places in 280 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/366 variables, 6/50 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 366/1544 variables, and 50 constraints, problems are : Problem set: 0 solved, 1194 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/17 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/370 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1194 constraints, Known Traps: 14/14 constraints]
After SMT, in 46167ms problems are : Problem set: 0 solved, 1194 unsolved
Search for dead transitions found 0 dead transitions in 46181ms
[2024-05-27 23:15:37] [INFO ] Flow matrix only has 1174 transitions (discarded 24 similar events)
[2024-05-27 23:15:37] [INFO ] Invariant cache hit.
[2024-05-27 23:15:38] [INFO ] Implicit Places using invariants in 437 ms returned []
[2024-05-27 23:15:38] [INFO ] Flow matrix only has 1174 transitions (discarded 24 similar events)
[2024-05-27 23:15:38] [INFO ] Invariant cache hit.
[2024-05-27 23:15:38] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 23:15:49] [INFO ] Implicit Places using invariants and state equation in 10762 ms returned []
Implicit Place search using SMT with State Equation took 11208 ms to find 0 implicit places.
[2024-05-27 23:15:49] [INFO ] Redundant transitions in 9 ms returned []
Running 1194 sub problems to find dead transitions.
[2024-05-27 23:15:49] [INFO ] Flow matrix only has 1174 transitions (discarded 24 similar events)
[2024-05-27 23:15:49] [INFO ] Invariant cache hit.
[2024-05-27 23:15:49] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-27 23:16:02] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 1 ms to minimize.
[2024-05-27 23:16:02] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 1 ms to minimize.
[2024-05-27 23:16:02] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 1 ms to minimize.
[2024-05-27 23:16:02] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 1 ms to minimize.
[2024-05-27 23:16:02] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 1 ms to minimize.
[2024-05-27 23:16:02] [INFO ] Deduced a trap composed of 143 places in 268 ms of which 3 ms to minimize.
[2024-05-27 23:16:03] [INFO ] Deduced a trap composed of 47 places in 328 ms of which 2 ms to minimize.
[2024-05-27 23:16:03] [INFO ] Deduced a trap composed of 186 places in 293 ms of which 3 ms to minimize.
[2024-05-27 23:16:13] [INFO ] Deduced a trap composed of 120 places in 290 ms of which 2 ms to minimize.
[2024-05-27 23:16:13] [INFO ] Deduced a trap composed of 126 places in 331 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-27 23:16:23] [INFO ] Deduced a trap composed of 45 places in 201 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 366/1544 variables, and 47 constraints, problems are : Problem set: 0 solved, 1194 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 14/17 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/370 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1194/1194 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 11/47 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-27 23:16:29] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 1 ms to minimize.
[2024-05-27 23:16:40] [INFO ] Deduced a trap composed of 184 places in 385 ms of which 3 ms to minimize.
[2024-05-27 23:16:41] [INFO ] Deduced a trap composed of 59 places in 247 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/366 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 366/1544 variables, and 50 constraints, problems are : Problem set: 0 solved, 1194 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/17 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/370 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1194 constraints, Known Traps: 14/14 constraints]
After SMT, in 65583ms problems are : Problem set: 0 solved, 1194 unsolved
Search for dead transitions found 0 dead transitions in 65600ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 123033 ms. Remains : 370/370 places, 1198/1198 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 46 steps (0 resets) in 5 ms. (7 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0)]
[2024-05-27 23:16:55] [INFO ] Flow matrix only has 1174 transitions (discarded 24 similar events)
[2024-05-27 23:16:55] [INFO ] Invariant cache hit.
[2024-05-27 23:16:55] [INFO ] [Real]Absence check using 17 positive place invariants in 24 ms returned sat
[2024-05-27 23:16:55] [INFO ] [Real]Absence check using 17 positive and 23 generalized place invariants in 55 ms returned sat
[2024-05-27 23:16:57] [INFO ] [Real]Absence check using state equation in 1371 ms returned sat
[2024-05-27 23:16:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 23:16:57] [INFO ] [Nat]Absence check using 17 positive place invariants in 16 ms returned sat
[2024-05-27 23:16:57] [INFO ] [Nat]Absence check using 17 positive and 23 generalized place invariants in 63 ms returned sat
[2024-05-27 23:17:00] [INFO ] [Nat]Absence check using state equation in 2487 ms returned sat
[2024-05-27 23:17:00] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 23:17:00] [INFO ] [Nat]Added 120 Read/Feed constraints in 516 ms returned sat
[2024-05-27 23:17:00] [INFO ] Computed and/alt/rep : 810/3427/792 causal constraints (skipped 378 transitions) in 105 ms.
[2024-05-27 23:17:06] [INFO ] Added : 220 causal constraints over 44 iterations in 5166 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 73 ms :[(NOT p0)]
Product exploration explored 100000 steps with 6782 reset in 451 ms.
Product exploration explored 100000 steps with 6762 reset in 429 ms.
Support contains 12 out of 370 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 370/370 places, 1198/1198 transitions.
Applied a total of 0 rules in 16 ms. Remains 370 /370 variables (removed 0) and now considering 1198/1198 (removed 0) transitions.
Running 1194 sub problems to find dead transitions.
[2024-05-27 23:17:07] [INFO ] Flow matrix only has 1174 transitions (discarded 24 similar events)
[2024-05-27 23:17:07] [INFO ] Invariant cache hit.
[2024-05-27 23:17:07] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-27 23:17:23] [INFO ] Deduced a trap composed of 47 places in 167 ms of which 2 ms to minimize.
[2024-05-27 23:17:23] [INFO ] Deduced a trap composed of 47 places in 88 ms of which 1 ms to minimize.
[2024-05-27 23:17:23] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 0 ms to minimize.
[2024-05-27 23:17:23] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 0 ms to minimize.
[2024-05-27 23:17:23] [INFO ] Deduced a trap composed of 47 places in 73 ms of which 1 ms to minimize.
[2024-05-27 23:17:24] [INFO ] Deduced a trap composed of 143 places in 369 ms of which 7 ms to minimize.
[2024-05-27 23:17:24] [INFO ] Deduced a trap composed of 47 places in 466 ms of which 3 ms to minimize.
[2024-05-27 23:17:25] [INFO ] Deduced a trap composed of 186 places in 359 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 Real declared 366/1544 variables, and 44 constraints, problems are : Problem set: 0 solved, 1194 unsolved in 20057 ms.
Refiners :[Positive P Invariants (semi-flows): 14/17 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/370 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1194/1194 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 8/44 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-27 23:17:38] [INFO ] Deduced a trap composed of 16 places in 177 ms of which 2 ms to minimize.
[2024-05-27 23:17:38] [INFO ] Deduced a trap composed of 36 places in 167 ms of which 1 ms to minimize.
[2024-05-27 23:17:39] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 2 ms to minimize.
[2024-05-27 23:17:48] [INFO ] Deduced a trap composed of 120 places in 310 ms of which 3 ms to minimize.
[2024-05-27 23:17:48] [INFO ] Deduced a trap composed of 27 places in 196 ms of which 2 ms to minimize.
[2024-05-27 23:17:49] [INFO ] Deduced a trap composed of 117 places in 324 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/366 variables, 6/50 constraints. Problems are: Problem set: 0 solved, 1194 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 366/1544 variables, and 50 constraints, problems are : Problem set: 0 solved, 1194 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 14/17 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/370 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1194 constraints, Known Traps: 14/14 constraints]
After SMT, in 46360ms problems are : Problem set: 0 solved, 1194 unsolved
Search for dead transitions found 0 dead transitions in 46378ms
[2024-05-27 23:17:53] [INFO ] Flow matrix only has 1174 transitions (discarded 24 similar events)
[2024-05-27 23:17:53] [INFO ] Invariant cache hit.
[2024-05-27 23:17:53] [INFO ] Implicit Places using invariants in 459 ms returned []
[2024-05-27 23:17:53] [INFO ] Flow matrix only has 1174 transitions (discarded 24 similar events)
[2024-05-27 23:17:53] [INFO ] Invariant cache hit.
[2024-05-27 23:17:54] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 23:17:59] [INFO ] Implicit Places using invariants and state equation in 6091 ms returned []
Implicit Place search using SMT with State Equation took 6561 ms to find 0 implicit places.
[2024-05-27 23:17:59] [INFO ] Redundant transitions in 12 ms returned []
Running 1194 sub problems to find dead transitions.
[2024-05-27 23:17:59] [INFO ] Flow matrix only has 1174 transitions (discarded 24 similar events)
[2024-05-27 23:18:00] [INFO ] Invariant cache hit.
[2024-05-27 23:18:00] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-27 23:18:15] [INFO ] Deduced a trap composed of 47 places in 140 ms of which 1 ms to minimize.
[2024-05-27 23:18:15] [INFO ] Deduced a trap composed of 47 places in 96 ms of which 1 ms to minimize.
[2024-05-27 23:18:15] [INFO ] Deduced a trap composed of 47 places in 77 ms of which 1 ms to minimize.
[2024-05-27 23:18:15] [INFO ] Deduced a trap composed of 47 places in 89 ms of which 0 ms to minimize.
[2024-05-27 23:18:15] [INFO ] Deduced a trap composed of 47 places in 68 ms of which 0 ms to minimize.
[2024-05-27 23:18:16] [INFO ] Deduced a trap composed of 143 places in 386 ms of which 2 ms to minimize.
[2024-05-27 23:18:16] [INFO ] Deduced a trap composed of 47 places in 354 ms of which 15 ms to minimize.
[2024-05-27 23:18:16] [INFO ] Deduced a trap composed of 186 places in 312 ms of which 3 ms to minimize.
[2024-05-27 23:18:28] [INFO ] Deduced a trap composed of 120 places in 306 ms of which 3 ms to minimize.
[2024-05-27 23:18:29] [INFO ] Deduced a trap composed of 126 places in 248 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 366/1544 variables, and 46 constraints, problems are : Problem set: 0 solved, 1194 unsolved in 30079 ms.
Refiners :[Positive P Invariants (semi-flows): 14/17 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/370 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1194/1194 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-27 23:18:43] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 1 ms to minimize.
[2024-05-27 23:18:49] [INFO ] Deduced a trap composed of 27 places in 192 ms of which 2 ms to minimize.
[2024-05-27 23:18:53] [INFO ] Deduced a trap composed of 184 places in 349 ms of which 3 ms to minimize.
[2024-05-27 23:18:55] [INFO ] Deduced a trap composed of 26 places in 366 ms of which 3 ms to minimize.
[2024-05-27 23:18:56] [INFO ] Deduced a trap composed of 57 places in 346 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/366 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1194 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 366/1544 variables, and 51 constraints, problems are : Problem set: 0 solved, 1194 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/17 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/370 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1194 constraints, Known Traps: 15/15 constraints]
After SMT, in 66758ms problems are : Problem set: 0 solved, 1194 unsolved
Search for dead transitions found 0 dead transitions in 66776ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 119771 ms. Remains : 370/370 places, 1198/1198 transitions.
Treatment of property PolyORBLF-COL-S04J04T06-LTLFireability-14 finished in 386704 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)||((F(p1) U p2) U p3)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p1))||p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
[2024-05-27 23:19:07] [INFO ] Flatten gal took : 89 ms
[2024-05-27 23:19:07] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 8 ms.
[2024-05-27 23:19:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 544 places, 1372 transitions and 6956 arcs took 24 ms.
Total runtime 2716664 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-COL-S04J04T06

IS_COLORED=
IS_NUPN=

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

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

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

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

Process ID: 4362
MODEL NAME: /home/mcc/execution/423/model
544 places, 1372 transitions.

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

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is PolyORBLF-COL-S04J04T06, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r289-tajo-171654445200124"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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