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-171654445300140.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-S04J04T10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445300140
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 10K Apr 11 17:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Apr 11 17:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 17:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 11 17:11 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.4K 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.6K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 17:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 11 17:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 11 17:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 11 17:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716851649727

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-S04J04T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 23:14:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-27 23:14:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 23:14:11] [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 23:14:11] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 23:14:11] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 807 ms
[2024-05-27 23:14:11] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 870 PT places and 5136.0 transition bindings in 26 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2024-05-27 23:14:12] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2024-05-27 23:14:12] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 6 formulas.
FORMULA PolyORBLF-COL-S04J04T10-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T10-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T10-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T10-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T10-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T10-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 10 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 10884 steps (2 resets) in 399 ms. (27 steps per ms) remains 0/21 properties
[2024-05-27 23:14:12] [INFO ] Flatten gal took : 39 ms
[2024-05-27 23:14:12] [INFO ] Flatten gal took : 9 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 23:14:12] [INFO ] Unfolded HLPN to a Petri net with 870 places and 5034 transitions 34774 arcs in 192 ms.
[2024-05-27 23:14:12] [INFO ] Unfolded 10 HLPN properties in 18 ms.
Ensure Unique test removed 2710 transitions
Reduce redundant transitions removed 2710 transitions.
Support contains 383 out of 870 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 870/870 places, 2324/2324 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 866 transition count 2324
Applied a total of 4 rules in 133 ms. Remains 866 /870 variables (removed 4) and now considering 2324/2324 (removed 0) transitions.
Running 2320 sub problems to find dead transitions.
[2024-05-27 23:14:13] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
// Phase 1: matrix 2284 rows 866 cols
[2024-05-27 23:14:13] [INFO ] Computed 54 invariants in 174 ms
[2024-05-27 23:14:13] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/862 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2320 unsolved
SMT process timed out in 34139ms, After SMT, problems are : Problem set: 0 solved, 2320 unsolved
Search for dead transitions found 0 dead transitions in 34246ms
[2024-05-27 23:14:47] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
[2024-05-27 23:14:47] [INFO ] Invariant cache hit.
[2024-05-27 23:14:47] [INFO ] Implicit Places using invariants in 403 ms returned [668, 669, 670, 671, 672, 673, 674, 675, 676, 677]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 416 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 856/870 places, 2324/2324 transitions.
Applied a total of 0 rules in 25 ms. Remains 856 /856 variables (removed 0) and now considering 2324/2324 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34941 ms. Remains : 856/870 places, 2324/2324 transitions.
Support contains 383 out of 856 places after structural reductions.
[2024-05-27 23:14:47] [INFO ] Flatten gal took : 194 ms
[2024-05-27 23:14:48] [INFO ] Flatten gal took : 171 ms
[2024-05-27 23:14:48] [INFO ] Input system was already deterministic with 2324 transitions.
Support contains 372 out of 856 places (down from 383) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 22 to 19
RANDOM walk for 9391 steps (1 resets) in 510 ms. (18 steps per ms) remains 0/19 properties
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 42 out of 856 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 856/856 places, 2324/2324 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 856 transition count 2234
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 180 place count 766 transition count 2234
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 180 place count 766 transition count 2174
Deduced a syphon composed of 60 places in 3 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 300 place count 706 transition count 2174
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 310 place count 696 transition count 2164
Iterating global reduction 2 with 10 rules applied. Total rules applied 320 place count 696 transition count 2164
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 3 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 520 place count 596 transition count 2064
Applied a total of 520 rules in 230 ms. Remains 596 /856 variables (removed 260) and now considering 2064/2324 (removed 260) transitions.
Running 2060 sub problems to find dead transitions.
[2024-05-27 23:14:49] [INFO ] Flow matrix only has 2024 transitions (discarded 40 similar events)
// Phase 1: matrix 2024 rows 596 cols
[2024-05-27 23:14:49] [INFO ] Computed 44 invariants in 49 ms
[2024-05-27 23:14:49] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2060 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 30/40 constraints. Problems are: Problem set: 0 solved, 2060 unsolved
[2024-05-27 23:15:20] [INFO ] Deduced a trap composed of 50 places in 202 ms of which 13 ms to minimize.
[2024-05-27 23:15:20] [INFO ] Deduced a trap composed of 50 places in 110 ms of which 2 ms to minimize.
[2024-05-27 23:15:20] [INFO ] Deduced a trap composed of 50 places in 108 ms of which 2 ms to minimize.
[2024-05-27 23:15:20] [INFO ] Deduced a trap composed of 50 places in 119 ms of which 1 ms to minimize.
[2024-05-27 23:15:20] [INFO ] Deduced a trap composed of 50 places in 93 ms of which 1 ms to minimize.
[2024-05-27 23:15:20] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 1 ms to minimize.
[2024-05-27 23:15:20] [INFO ] Deduced a trap composed of 50 places in 90 ms of which 1 ms to minimize.
[2024-05-27 23:15:21] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2024-05-27 23:15:21] [INFO ] Deduced a trap composed of 50 places in 135 ms of which 1 ms to minimize.
[2024-05-27 23:15:23] [INFO ] Deduced a trap composed of 305 places in 560 ms of which 4 ms to minimize.
[2024-05-27 23:15:23] [INFO ] Deduced a trap composed of 294 places in 483 ms of which 4 ms to minimize.
[2024-05-27 23:15:24] [INFO ] Deduced a trap composed of 281 places in 451 ms of which 4 ms to minimize.
SMT process timed out in 34645ms, After SMT, problems are : Problem set: 0 solved, 2060 unsolved
Search for dead transitions found 0 dead transitions in 34678ms
[2024-05-27 23:15:24] [INFO ] Flow matrix only has 2024 transitions (discarded 40 similar events)
[2024-05-27 23:15:24] [INFO ] Invariant cache hit.
[2024-05-27 23:15:24] [INFO ] Implicit Places using invariants in 524 ms returned []
[2024-05-27 23:15:24] [INFO ] Flow matrix only has 2024 transitions (discarded 40 similar events)
[2024-05-27 23:15:24] [INFO ] Invariant cache hit.
[2024-05-27 23:15:25] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-27 23:15:35] [INFO ] Implicit Places using invariants and state equation in 10510 ms returned []
Implicit Place search using SMT with State Equation took 11045 ms to find 0 implicit places.
[2024-05-27 23:15:35] [INFO ] Redundant transitions in 111 ms returned []
Running 2060 sub problems to find dead transitions.
[2024-05-27 23:15:35] [INFO ] Flow matrix only has 2024 transitions (discarded 40 similar events)
[2024-05-27 23:15:35] [INFO ] Invariant cache hit.
[2024-05-27 23:15:35] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2060 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 30/40 constraints. Problems are: Problem set: 0 solved, 2060 unsolved
[2024-05-27 23:16:05] [INFO ] Deduced a trap composed of 50 places in 133 ms of which 2 ms to minimize.
[2024-05-27 23:16:05] [INFO ] Deduced a trap composed of 50 places in 120 ms of which 2 ms to minimize.
[2024-05-27 23:16:06] [INFO ] Deduced a trap composed of 50 places in 94 ms of which 1 ms to minimize.
[2024-05-27 23:16:06] [INFO ] Deduced a trap composed of 50 places in 70 ms of which 1 ms to minimize.
[2024-05-27 23:16:06] [INFO ] Deduced a trap composed of 50 places in 49 ms of which 1 ms to minimize.
[2024-05-27 23:16:06] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 1 ms to minimize.
[2024-05-27 23:16:06] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
[2024-05-27 23:16:06] [INFO ] Deduced a trap composed of 50 places in 36 ms of which 1 ms to minimize.
[2024-05-27 23:16:06] [INFO ] Deduced a trap composed of 50 places in 36 ms of which 1 ms to minimize.
[2024-05-27 23:16:07] [INFO ] Deduced a trap composed of 280 places in 534 ms of which 5 ms to minimize.
[2024-05-27 23:16:08] [INFO ] Deduced a trap composed of 300 places in 397 ms of which 3 ms to minimize.
[2024-05-27 23:16:11] [INFO ] Deduced a trap composed of 50 places in 66 ms of which 2 ms to minimize.
[2024-05-27 23:16:13] [INFO ] Deduced a trap composed of 290 places in 434 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2620 variables, and 53 constraints, problems are : Problem set: 0 solved, 2060 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 10/12 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/596 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2060/2060 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2060 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2060 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 30/40 constraints. Problems are: Problem set: 0 solved, 2060 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 2060 unsolved
[2024-05-27 23:16:33] [INFO ] Deduced a trap composed of 23 places in 174 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 592/2620 variables, and 54 constraints, problems are : Problem set: 0 solved, 2060 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 10/12 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/596 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2060 constraints, Known Traps: 14/14 constraints]
After SMT, in 74778ms problems are : Problem set: 0 solved, 2060 unsolved
Search for dead transitions found 0 dead transitions in 74801ms
Starting structural reductions in SI_LTL mode, iteration 1 : 596/856 places, 2064/2324 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 120890 ms. Remains : 596/856 places, 2064/2324 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J04T10-LTLFireability-00
Product exploration explored 100000 steps with 5 reset in 1003 ms.
Stack based approach found an accepted trace after 2812 steps with 0 reset with depth 2813 and stack size 2813 in 28 ms.
FORMULA PolyORBLF-COL-S04J04T10-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-COL-S04J04T10-LTLFireability-00 finished in 122169 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((G(F(p0))||(X(F(p0))&&p1))))||(G(p2)&&F((G(F(p0))||(X(F(p0))&&p3)))))))'
Support contains 68 out of 856 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 856/856 places, 2324/2324 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 846 transition count 2314
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 846 transition count 2314
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 836 transition count 2304
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 836 transition count 2304
Applied a total of 40 rules in 81 ms. Remains 836 /856 variables (removed 20) and now considering 2304/2324 (removed 20) transitions.
Running 2300 sub problems to find dead transitions.
[2024-05-27 23:16:51] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
// Phase 1: matrix 2264 rows 836 cols
[2024-05-27 23:16:51] [INFO ] Computed 44 invariants in 86 ms
[2024-05-27 23:16:51] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
SMT process timed out in 34501ms, After SMT, problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 34536ms
[2024-05-27 23:17:25] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-05-27 23:17:25] [INFO ] Invariant cache hit.
[2024-05-27 23:17:26] [INFO ] Implicit Places using invariants in 643 ms returned []
[2024-05-27 23:17:26] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-05-27 23:17:26] [INFO ] Invariant cache hit.
[2024-05-27 23:17:27] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-27 23:17:50] [INFO ] Implicit Places using invariants and state equation in 24259 ms returned []
Implicit Place search using SMT with State Equation took 24904 ms to find 0 implicit places.
Running 2300 sub problems to find dead transitions.
[2024-05-27 23:17:50] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-05-27 23:17:50] [INFO ] Invariant cache hit.
[2024-05-27 23:17:50] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/832 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
[2024-05-27 23:18:32] [INFO ] Deduced a trap composed of 74 places in 119 ms of which 2 ms to minimize.
[2024-05-27 23:18:32] [INFO ] Deduced a trap composed of 74 places in 69 ms of which 1 ms to minimize.
[2024-05-27 23:18:32] [INFO ] Deduced a trap composed of 74 places in 75 ms of which 1 ms to minimize.
[2024-05-27 23:18:32] [INFO ] Deduced a trap composed of 74 places in 91 ms of which 2 ms to minimize.
[2024-05-27 23:18:32] [INFO ] Deduced a trap composed of 74 places in 72 ms of which 2 ms to minimize.
[2024-05-27 23:18:32] [INFO ] Deduced a trap composed of 74 places in 72 ms of which 1 ms to minimize.
[2024-05-27 23:18:32] [INFO ] Deduced a trap composed of 74 places in 80 ms of which 1 ms to minimize.
[2024-05-27 23:18:32] [INFO ] Deduced a trap composed of 74 places in 90 ms of which 2 ms to minimize.
[2024-05-27 23:18:32] [INFO ] Deduced a trap composed of 74 places in 79 ms of which 1 ms to minimize.
[2024-05-27 23:18:34] [INFO ] Deduced a trap composed of 489 places in 600 ms of which 6 ms to minimize.
[2024-05-27 23:18:35] [INFO ] Deduced a trap composed of 511 places in 552 ms of which 5 ms to minimize.
[2024-05-27 23:18:35] [INFO ] Deduced a trap composed of 223 places in 497 ms of which 6 ms to minimize.
[2024-05-27 23:18:35] [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 832/3100 variables, and 44 constraints, problems are : Problem set: 0 solved, 2300 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 9/11 constraints, Generalized P Invariants (flows): 22/33 constraints, State Equation: 0/836 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2300/2300 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/832 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/832 variables, 13/44 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
[2024-05-27 23:18:43] [INFO ] Deduced a trap composed of 411 places in 538 ms of which 6 ms to minimize.
[2024-05-27 23:18:46] [INFO ] Deduced a trap composed of 579 places in 575 ms of which 6 ms to minimize.
[2024-05-27 23:18:47] [INFO ] Deduced a trap composed of 510 places in 655 ms of which 6 ms to minimize.
[2024-05-27 23:18:48] [INFO ] Deduced a trap composed of 498 places in 613 ms of which 5 ms to minimize.
[2024-05-27 23:18:48] [INFO ] Deduced a trap composed of 507 places in 537 ms of which 4 ms to minimize.
[2024-05-27 23:18:52] [INFO ] Deduced a trap composed of 455 places in 580 ms of which 6 ms to minimize.
[2024-05-27 23:18:52] [INFO ] Deduced a trap composed of 480 places in 509 ms of which 5 ms to minimize.
[2024-05-27 23:18:53] [INFO ] Deduced a trap composed of 492 places in 495 ms of which 5 ms to minimize.
[2024-05-27 23:18:58] [INFO ] Deduced a trap composed of 79 places in 386 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 832/3100 variables, and 53 constraints, problems are : Problem set: 0 solved, 2300 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 9/11 constraints, Generalized P Invariants (flows): 22/33 constraints, State Equation: 0/836 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2300 constraints, Known Traps: 22/22 constraints]
After SMT, in 76142ms problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 76188ms
Starting structural reductions in LTL mode, iteration 1 : 836/856 places, 2304/2324 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 135728 ms. Remains : 836/856 places, 2304/2324 transitions.
Stuttering acceptance computed with spot in 299 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J04T10-LTLFireability-01
Product exploration explored 100000 steps with 1185 reset in 1311 ms.
Product exploration explored 100000 steps with 1183 reset in 1066 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 p3), (X p2), (X p3), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (OR (NOT p0) (AND p2 p3))), (X (OR (NOT p0) p3)), (X p0), (X (X p2)), (X (X p3)), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (OR (NOT p0) (AND p2 p3)))), (X (X (OR (NOT p0) p3))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 188 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 911 ms. (43 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 833 ms. (47 steps per ms) remains 1/1 properties
[2024-05-27 23:19:10] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-05-27 23:19:10] [INFO ] Invariant cache hit.
[2024-05-27 23:19:10] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 96/154 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/163 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 651/814 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/814 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/819 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/819 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf3 is UNSAT
After SMT solving in domain Real declared 834/3100 variables, and 43 constraints, problems are : Problem set: 1 solved, 0 unsolved in 545 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 0/836 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 714ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 p3), (X p2), (X p3), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (OR (NOT p0) (AND p2 p3))), (X (OR (NOT p0) p3)), (X p0), (X (X p2)), (X (X p3)), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (OR (NOT p0) (AND p2 p3)))), (X (X (OR (NOT p0) p3))), (X (X p0)), (G (OR p0 p2))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (AND p2 p3)))), (F (NOT p0)), (F (NOT (OR (NOT p0) p3))), (F (NOT p2)), (F (NOT (OR (NOT p2) p3))), (F (NOT p3))]
Knowledge based reduction with 16 factoid took 386 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
Stuttering acceptance computed with spot in 226 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
Support contains 68 out of 836 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 836/836 places, 2304/2304 transitions.
Applied a total of 0 rules in 46 ms. Remains 836 /836 variables (removed 0) and now considering 2304/2304 (removed 0) transitions.
Running 2300 sub problems to find dead transitions.
[2024-05-27 23:19:12] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-05-27 23:19:12] [INFO ] Invariant cache hit.
[2024-05-27 23:19:12] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
SMT process timed out in 35098ms, After SMT, problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 35138ms
[2024-05-27 23:19:47] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-05-27 23:19:47] [INFO ] Invariant cache hit.
[2024-05-27 23:19:48] [INFO ] Implicit Places using invariants in 741 ms returned []
[2024-05-27 23:19:48] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-05-27 23:19:48] [INFO ] Invariant cache hit.
[2024-05-27 23:19:49] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-27 23:20:11] [INFO ] Implicit Places using invariants and state equation in 23610 ms returned []
Implicit Place search using SMT with State Equation took 24357 ms to find 0 implicit places.
Running 2300 sub problems to find dead transitions.
[2024-05-27 23:20:11] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-05-27 23:20:11] [INFO ] Invariant cache hit.
[2024-05-27 23:20:11] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/832 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
[2024-05-27 23:20:50] [INFO ] Deduced a trap composed of 74 places in 112 ms of which 3 ms to minimize.
[2024-05-27 23:20:50] [INFO ] Deduced a trap composed of 74 places in 98 ms of which 1 ms to minimize.
[2024-05-27 23:20:50] [INFO ] Deduced a trap composed of 74 places in 93 ms of which 2 ms to minimize.
[2024-05-27 23:20:50] [INFO ] Deduced a trap composed of 74 places in 80 ms of which 1 ms to minimize.
[2024-05-27 23:20:50] [INFO ] Deduced a trap composed of 74 places in 78 ms of which 1 ms to minimize.
[2024-05-27 23:20:51] [INFO ] Deduced a trap composed of 74 places in 99 ms of which 1 ms to minimize.
[2024-05-27 23:20:51] [INFO ] Deduced a trap composed of 74 places in 79 ms of which 2 ms to minimize.
[2024-05-27 23:20:51] [INFO ] Deduced a trap composed of 74 places in 63 ms of which 1 ms to minimize.
[2024-05-27 23:20:51] [INFO ] Deduced a trap composed of 74 places in 85 ms of which 2 ms to minimize.
[2024-05-27 23:20:52] [INFO ] Deduced a trap composed of 489 places in 511 ms of which 6 ms to minimize.
[2024-05-27 23:20:53] [INFO ] Deduced a trap composed of 511 places in 597 ms of which 5 ms to minimize.
[2024-05-27 23:20:54] [INFO ] Deduced a trap composed of 223 places in 609 ms of which 6 ms to minimize.
[2024-05-27 23:20:54] [INFO ] Deduced a trap composed of 74 places in 59 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 832/3100 variables, and 44 constraints, problems are : Problem set: 0 solved, 2300 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 9/11 constraints, Generalized P Invariants (flows): 22/33 constraints, State Equation: 0/836 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2300/2300 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/832 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/832 variables, 13/44 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
[2024-05-27 23:21:02] [INFO ] Deduced a trap composed of 411 places in 480 ms of which 5 ms to minimize.
[2024-05-27 23:21:05] [INFO ] Deduced a trap composed of 579 places in 515 ms of which 5 ms to minimize.
[2024-05-27 23:21:06] [INFO ] Deduced a trap composed of 510 places in 506 ms of which 5 ms to minimize.
[2024-05-27 23:21:06] [INFO ] Deduced a trap composed of 498 places in 484 ms of which 5 ms to minimize.
[2024-05-27 23:21:07] [INFO ] Deduced a trap composed of 507 places in 477 ms of which 5 ms to minimize.
[2024-05-27 23:21:10] [INFO ] Deduced a trap composed of 455 places in 555 ms of which 6 ms to minimize.
[2024-05-27 23:21:11] [INFO ] Deduced a trap composed of 480 places in 560 ms of which 6 ms to minimize.
[2024-05-27 23:21:12] [INFO ] Deduced a trap composed of 492 places in 516 ms of which 5 ms to minimize.
[2024-05-27 23:21:17] [INFO ] Deduced a trap composed of 79 places in 329 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 832/3100 variables, and 53 constraints, problems are : Problem set: 0 solved, 2300 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 9/11 constraints, Generalized P Invariants (flows): 22/33 constraints, State Equation: 0/836 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2300 constraints, Known Traps: 22/22 constraints]
After SMT, in 74802ms problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 74843ms
Finished structural reductions in LTL mode , in 1 iterations and 134404 ms. Remains : 836/836 places, 2304/2304 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 p2 p0 p3), (X p2), (X p3), (X (NOT (AND p2 (NOT p3)))), (X (OR (NOT p0) (AND p2 p3))), (X (OR (NOT p0) p3)), (X p0), (X (X p2)), (X (X p3)), (X (X (NOT (AND p2 (NOT p3))))), (X (X (OR (NOT p0) (AND p2 p3)))), (X (X (OR (NOT p0) p3))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 204 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
RANDOM walk for 1069 steps (0 resets) in 34 ms. (30 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p2 p0 p3), (X p2), (X p3), (X (NOT (AND p2 (NOT p3)))), (X (OR (NOT p0) (AND p2 p3))), (X (OR (NOT p0) p3)), (X p0), (X (X p2)), (X (X p3)), (X (X (NOT (AND p2 (NOT p3))))), (X (X (OR (NOT p0) (AND p2 p3)))), (X (X (OR (NOT p0) p3))), (X (X p0))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p3))), (F (NOT (OR (NOT p0) (AND p2 p3)))), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR (NOT p2) p3))), (F (NOT p3))]
Knowledge based reduction with 13 factoid took 347 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
Product exploration explored 100000 steps with 1174 reset in 1109 ms.
Product exploration explored 100000 steps with 1042 reset in 928 ms.
Applying partial POR strategy [false, true, false, false]
Stuttering acceptance computed with spot in 202 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
Support contains 68 out of 836 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 836/836 places, 2304/2304 transitions.
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 836 transition count 2304
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 20 Pre rules applied. Total rules applied 60 place count 836 transition count 2304
Deduced a syphon composed of 80 places in 2 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 80 place count 836 transition count 2304
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 100 place count 816 transition count 2284
Deduced a syphon composed of 60 places in 2 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 120 place count 816 transition count 2284
Performed 150 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 210 places in 2 ms
Iterating global reduction 1 with 150 rules applied. Total rules applied 270 place count 816 transition count 2284
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 310 place count 776 transition count 2244
Deduced a syphon composed of 180 places in 1 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 350 place count 776 transition count 2244
Deduced a syphon composed of 180 places in 1 ms
Applied a total of 350 rules in 299 ms. Remains 776 /836 variables (removed 60) and now considering 2244/2304 (removed 60) transitions.
Running 2240 sub problems to find dead transitions.
[2024-05-27 23:21:30] [INFO ] Flow matrix only has 2204 transitions (discarded 40 similar events)
// Phase 1: matrix 2204 rows 776 cols
[2024-05-27 23:21:30] [INFO ] Computed 44 invariants in 67 ms
[2024-05-27 23:21:30] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/772 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2240 unsolved
SMT process timed out in 35884ms, After SMT, problems are : Problem set: 0 solved, 2240 unsolved
Search for dead transitions found 0 dead transitions in 35918ms
[2024-05-27 23:22:06] [INFO ] Redundant transitions in 101 ms returned []
Running 2240 sub problems to find dead transitions.
[2024-05-27 23:22:06] [INFO ] Flow matrix only has 2204 transitions (discarded 40 similar events)
[2024-05-27 23:22:06] [INFO ] Invariant cache hit.
[2024-05-27 23:22:06] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/772 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/772 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 2240 unsolved
[2024-05-27 23:22:48] [INFO ] Deduced a trap composed of 50 places in 331 ms of which 4 ms to minimize.
[2024-05-27 23:22:48] [INFO ] Deduced a trap composed of 50 places in 294 ms of which 4 ms to minimize.
[2024-05-27 23:22:48] [INFO ] Deduced a trap composed of 50 places in 268 ms of which 3 ms to minimize.
[2024-05-27 23:22:48] [INFO ] Deduced a trap composed of 50 places in 229 ms of which 3 ms to minimize.
[2024-05-27 23:22:49] [INFO ] Deduced a trap composed of 50 places in 176 ms of which 2 ms to minimize.
[2024-05-27 23:22:49] [INFO ] Deduced a trap composed of 50 places in 147 ms of which 2 ms to minimize.
[2024-05-27 23:22:49] [INFO ] Deduced a trap composed of 50 places in 118 ms of which 2 ms to minimize.
[2024-05-27 23:22:49] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 1 ms to minimize.
[2024-05-27 23:22:49] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 1 ms to minimize.
[2024-05-27 23:22:49] [INFO ] Deduced a trap composed of 50 places in 64 ms of which 1 ms to minimize.
[2024-05-27 23:22:51] [INFO ] Deduced a trap composed of 315 places in 562 ms of which 6 ms to minimize.
[2024-05-27 23:22:51] [INFO ] Deduced a trap composed of 295 places in 514 ms of which 5 ms to minimize.
[2024-05-27 23:22:52] [INFO ] Deduced a trap composed of 377 places in 497 ms of which 5 ms to minimize.
SMT process timed out in 45578ms, After SMT, problems are : Problem set: 0 solved, 2240 unsolved
Search for dead transitions found 0 dead transitions in 45606ms
Starting structural reductions in SI_LTL mode, iteration 1 : 776/836 places, 2244/2304 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 81956 ms. Remains : 776/836 places, 2244/2304 transitions.
Support contains 68 out of 836 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 836/836 places, 2304/2304 transitions.
Applied a total of 0 rules in 14 ms. Remains 836 /836 variables (removed 0) and now considering 2304/2304 (removed 0) transitions.
Running 2300 sub problems to find dead transitions.
[2024-05-27 23:22:52] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
// Phase 1: matrix 2264 rows 836 cols
[2024-05-27 23:22:52] [INFO ] Computed 44 invariants in 77 ms
[2024-05-27 23:22:52] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
SMT process timed out in 35273ms, After SMT, problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 35302ms
[2024-05-27 23:23:27] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-05-27 23:23:27] [INFO ] Invariant cache hit.
[2024-05-27 23:23:28] [INFO ] Implicit Places using invariants in 531 ms returned []
[2024-05-27 23:23:28] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-05-27 23:23:28] [INFO ] Invariant cache hit.
[2024-05-27 23:23:29] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-27 23:23:53] [INFO ] Implicit Places using invariants and state equation in 25305 ms returned []
Implicit Place search using SMT with State Equation took 25839 ms to find 0 implicit places.
Running 2300 sub problems to find dead transitions.
[2024-05-27 23:23:53] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-05-27 23:23:53] [INFO ] Invariant cache hit.
[2024-05-27 23:23:53] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/832 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
[2024-05-27 23:24:34] [INFO ] Deduced a trap composed of 74 places in 111 ms of which 2 ms to minimize.
[2024-05-27 23:24:35] [INFO ] Deduced a trap composed of 74 places in 81 ms of which 1 ms to minimize.
[2024-05-27 23:24:35] [INFO ] Deduced a trap composed of 74 places in 90 ms of which 2 ms to minimize.
[2024-05-27 23:24:35] [INFO ] Deduced a trap composed of 74 places in 73 ms of which 2 ms to minimize.
[2024-05-27 23:24:35] [INFO ] Deduced a trap composed of 74 places in 86 ms of which 1 ms to minimize.
[2024-05-27 23:24:35] [INFO ] Deduced a trap composed of 74 places in 73 ms of which 1 ms to minimize.
[2024-05-27 23:24:35] [INFO ] Deduced a trap composed of 74 places in 59 ms of which 1 ms to minimize.
[2024-05-27 23:24:35] [INFO ] Deduced a trap composed of 74 places in 79 ms of which 1 ms to minimize.
[2024-05-27 23:24:35] [INFO ] Deduced a trap composed of 74 places in 59 ms of which 1 ms to minimize.
[2024-05-27 23:24:36] [INFO ] Deduced a trap composed of 489 places in 477 ms of which 5 ms to minimize.
[2024-05-27 23:24:37] [INFO ] Deduced a trap composed of 511 places in 489 ms of which 6 ms to minimize.
[2024-05-27 23:24:38] [INFO ] Deduced a trap composed of 223 places in 458 ms of which 5 ms to minimize.
[2024-05-27 23:24:38] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 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 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 10.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 1.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 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 0.0)
(s292 0.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.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 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 1.0)
(s363 1.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 1.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 1.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 1.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 1.0)
(s485 1.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 timeout
0.0)
(s510 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 832/3100 variables, and 44 constraints, problems are : Problem set: 0 solved, 2300 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 9/11 constraints, Generalized P Invariants (flows): 22/33 constraints, State Equation: 0/836 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2300/2300 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/832 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/832 variables, 13/44 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
[2024-05-27 23:24:45] [INFO ] Deduced a trap composed of 411 places in 501 ms of which 4 ms to minimize.
[2024-05-27 23:24:48] [INFO ] Deduced a trap composed of 579 places in 500 ms of which 4 ms to minimize.
[2024-05-27 23:24:48] [INFO ] Deduced a trap composed of 510 places in 524 ms of which 6 ms to minimize.
[2024-05-27 23:24:49] [INFO ] Deduced a trap composed of 498 places in 669 ms of which 5 ms to minimize.
[2024-05-27 23:24:49] [INFO ] Deduced a trap composed of 507 places in 563 ms of which 5 ms to minimize.
[2024-05-27 23:24:53] [INFO ] Deduced a trap composed of 455 places in 466 ms of which 4 ms to minimize.
[2024-05-27 23:24:54] [INFO ] Deduced a trap composed of 480 places in 578 ms of which 5 ms to minimize.
[2024-05-27 23:24:54] [INFO ] Deduced a trap composed of 492 places in 469 ms of which 5 ms to minimize.
[2024-05-27 23:24:58] [INFO ] Deduced a trap composed of 79 places in 294 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 832/3100 variables, and 53 constraints, problems are : Problem set: 0 solved, 2300 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 9/11 constraints, Generalized P Invariants (flows): 22/33 constraints, State Equation: 0/836 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2300 constraints, Known Traps: 22/22 constraints]
After SMT, in 75189ms problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 75212ms
Finished structural reductions in LTL mode , in 1 iterations and 136379 ms. Remains : 836/836 places, 2304/2304 transitions.
Treatment of property PolyORBLF-COL-S04J04T10-LTLFireability-01 finished in 497954 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G(p1)))'
Support contains 61 out of 856 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 856/856 places, 2324/2324 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 846 transition count 2314
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 846 transition count 2314
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 836 transition count 2304
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 836 transition count 2304
Applied a total of 40 rules in 44 ms. Remains 836 /856 variables (removed 20) and now considering 2304/2324 (removed 20) transitions.
Running 2300 sub problems to find dead transitions.
[2024-05-27 23:25:09] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-05-27 23:25:09] [INFO ] Invariant cache hit.
[2024-05-27 23:25:09] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 1.0)
(s17 0.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.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 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 10.0)
(s203 1.0)
(s204 0.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 0.0)
(s287 0.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 timeout
1.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
SMT process timed out in 34071ms, After SMT, problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 34103ms
[2024-05-27 23:25:43] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-05-27 23:25:43] [INFO ] Invariant cache hit.
[2024-05-27 23:25:43] [INFO ] Implicit Places using invariants in 630 ms returned []
[2024-05-27 23:25:43] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-05-27 23:25:43] [INFO ] Invariant cache hit.
[2024-05-27 23:25:45] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-27 23:26:07] [INFO ] Implicit Places using invariants and state equation in 23157 ms returned []
Implicit Place search using SMT with State Equation took 23790 ms to find 0 implicit places.
Running 2300 sub problems to find dead transitions.
[2024-05-27 23:26:07] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-05-27 23:26:07] [INFO ] Invariant cache hit.
[2024-05-27 23:26:07] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/832 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
[2024-05-27 23:26:48] [INFO ] Deduced a trap composed of 74 places in 111 ms of which 2 ms to minimize.
[2024-05-27 23:26:48] [INFO ] Deduced a trap composed of 74 places in 58 ms of which 1 ms to minimize.
[2024-05-27 23:26:48] [INFO ] Deduced a trap composed of 74 places in 58 ms of which 1 ms to minimize.
[2024-05-27 23:26:48] [INFO ] Deduced a trap composed of 74 places in 80 ms of which 1 ms to minimize.
[2024-05-27 23:26:48] [INFO ] Deduced a trap composed of 74 places in 72 ms of which 1 ms to minimize.
[2024-05-27 23:26:49] [INFO ] Deduced a trap composed of 74 places in 80 ms of which 1 ms to minimize.
[2024-05-27 23:26:49] [INFO ] Deduced a trap composed of 74 places in 61 ms of which 1 ms to minimize.
[2024-05-27 23:26:49] [INFO ] Deduced a trap composed of 74 places in 62 ms of which 1 ms to minimize.
[2024-05-27 23:26:49] [INFO ] Deduced a trap composed of 74 places in 68 ms of which 1 ms to minimize.
[2024-05-27 23:26:50] [INFO ] Deduced a trap composed of 489 places in 426 ms of which 5 ms to minimize.
[2024-05-27 23:26:50] [INFO ] Deduced a trap composed of 511 places in 437 ms of which 5 ms to minimize.
[2024-05-27 23:26:51] [INFO ] Deduced a trap composed of 223 places in 502 ms of which 5 ms to minimize.
[2024-05-27 23:26:51] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 832/3100 variables, and 44 constraints, problems are : Problem set: 0 solved, 2300 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 9/11 constraints, Generalized P Invariants (flows): 22/33 constraints, State Equation: 0/836 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2300/2300 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/832 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/832 variables, 13/44 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
[2024-05-27 23:26:58] [INFO ] Deduced a trap composed of 411 places in 431 ms of which 5 ms to minimize.
[2024-05-27 23:27:01] [INFO ] Deduced a trap composed of 579 places in 492 ms of which 5 ms to minimize.
[2024-05-27 23:27:01] [INFO ] Deduced a trap composed of 510 places in 473 ms of which 4 ms to minimize.
[2024-05-27 23:27:02] [INFO ] Deduced a trap composed of 498 places in 482 ms of which 5 ms to minimize.
[2024-05-27 23:27:03] [INFO ] Deduced a trap composed of 507 places in 485 ms of which 5 ms to minimize.
[2024-05-27 23:27:06] [INFO ] Deduced a trap composed of 455 places in 438 ms of which 4 ms to minimize.
[2024-05-27 23:27:07] [INFO ] Deduced a trap composed of 480 places in 540 ms of which 6 ms to minimize.
[2024-05-27 23:27:07] [INFO ] Deduced a trap composed of 492 places in 516 ms of which 5 ms to minimize.
[2024-05-27 23:27:12] [INFO ] Deduced a trap composed of 79 places in 332 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 9)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 0)
(s19 0)
(s20 1)
(s21 2)
(s22 1)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 1)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 9)
(s203 1)
(s204 0)
(s205 1)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 1)
(s289 1)
(s290 1)
(s291 0)
(s292 0)
(s293 0)
(s294 1)
(s295 1)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 1)
(s350 1)
(s351 1)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 1)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 1)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 1)
(s485 1)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 4)
(s493 1)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 1)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 0)
(s541 0)
(s542 0)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 0)
(s552 0)
(s553 0)
(s554 1)
(s555 0)
(s556 0)
(s557 0)
(s558 1)
(s559 0)
(s560 0)
(s561 0)
(s562 1)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 0)
(s570 0)
(s571 0)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 0)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 0)
(s588 0)
(s589 0)
(s590 0)
(s591 0)
(s592 0)
(s593 0)
(s594 0)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 0)
(s612 0)
(s613 0)
(s614 0)
(s615 0)
(s616 0)
(s617 0)
(s618 0)
(s619 0)
(s620 0)
(s621 0)
(s622 0)
(s623 0)
(s624 0)
(s625 0)
(s626 0)
(s627 0)
(s628 0)
(s629 0)
(s630 0)
(s631 0)
(s632 0)
(s633 0)
(s634 0)
(s635 0)
(s636 0)
(s637 0)
(s638 0)
(s639 0)
(s640 0)
(s641 0)
(s642 0)
(s643 0)
(s644 0)
(s645 0)
(s646 0)
(s647 0)
(s648 0)
(s649 0)
(s650 0)
(s651 0)
(s652 0)
(s653 0)
(s654 0)
(s655 0)
(s656 0)
(s657 0)
(s658 0)
(s659 0)
(s660 0)
(s661 0)
(s662 0)
(s663 0)
(s664 0)
(s665 0)
(s666 0)
(s667 0)
(s668 0)
(s669 0)
(s670 0)
(s671 0)
(s672 0)
(s673 0)
(s674 0)
(s675 0)
(s676 0)
(s677 0)
(s678 0)
(s679 0)
(s680 0)
(s681 0)
(s682 0)
(s683 0)
(s684 0)
(s685 0)
(s686 0)
(s687 0)
(s688 0)
(s689 0)
(s690 0)
(s691 0)
(s692 0)
(s693 0)
(s694 0)
(s695 0)
(s696 0)
(s697 0)
(s698 0)
(s699 0)
(s700 0)
(s701 0)
(s702 0)
(s703 0)
(s704 0)
(s705 0)
(s706 0)
(s707 0)
(s708 0)
(s709 0)
(s710 0)
(s711 0)
(s712 0)
(s713 0)
(s714 0)
(s715 0)
(s716 0)
(s717 0)
(s718 0)
(s719 1)
(s720 0)
(s721 0)
(s722 0)
(s723 0)
(s724 0)
(s725 0)
(s726 0)
(s727 0)
(s728 0)
(s729 0)
(s730 2)
(s731 0)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 0)
(s737 0)
(s738 0)
(s739 0)
(s740 0)
(s741 0)
(s742 0)
(s743 0)
(s744 0)
(s745 0)
(s746 0)
(s747 0)
(s748 0)
(s749 0)
(s750 0)
(s751 0)
(s752 0)
(s753 0)
(s754 0)
(s755 0)
(s756 0)
(s757 0)
(s758 0)
(s759 0)
(s760 0)
(s761 0)
(s762 0)
(s763 0)
(s764 0)
(s765 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 832/3100 variables, and 53 constraints, problems are : Problem set: 0 solved, 2300 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 9/11 constraints, Generalized P Invariants (flows): 22/33 constraints, State Equation: 0/836 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2300 constraints, Known Traps: 22/22 constraints]
After SMT, in 75671ms problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 75708ms
Starting structural reductions in LTL mode, iteration 1 : 836/856 places, 2304/2324 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 133659 ms. Remains : 836/856 places, 2304/2324 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-COL-S04J04T10-LTLFireability-02
Product exploration explored 100000 steps with 1229 reset in 479 ms.
Product exploration explored 100000 steps with 1224 reset in 487 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 99 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 342 steps (0 resets) in 6 ms. (48 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 9 factoid took 107 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 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
[2024-05-27 23:27:24] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-05-27 23:27:24] [INFO ] Invariant cache hit.
[2024-05-27 23:27:25] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-27 23:27:25] [INFO ] [Real]Absence check using 11 positive and 33 generalized place invariants in 116 ms returned sat
[2024-05-27 23:27:29] [INFO ] [Real]Absence check using state equation in 3802 ms returned sat
[2024-05-27 23:27:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 23:27:30] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-27 23:27:30] [INFO ] [Nat]Absence check using 11 positive and 33 generalized place invariants in 158 ms returned sat
[2024-05-27 23:27:34] [INFO ] [Nat]Absence check using state equation in 3990 ms returned sat
[2024-05-27 23:27:34] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-27 23:27:35] [INFO ] [Nat]Added 200 Read/Feed constraints in 659 ms returned sat
[2024-05-27 23:27:35] [INFO ] Deduced a trap composed of 74 places in 476 ms of which 2 ms to minimize.
[2024-05-27 23:27:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 784 ms
[2024-05-27 23:27:36] [INFO ] Computed and/alt/rep : 1330/3486/1300 causal constraints (skipped 960 transitions) in 250 ms.
[2024-05-27 23:27:43] [INFO ] Added : 184 causal constraints over 38 iterations in 7289 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 10 out of 836 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 836/836 places, 2304/2304 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 836 transition count 2254
Reduce places removed 50 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 60 rules applied. Total rules applied 110 place count 786 transition count 2244
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 120 place count 776 transition count 2244
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 120 place count 776 transition count 2144
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 320 place count 676 transition count 2144
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 500 place count 586 transition count 2054
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 510 place count 576 transition count 2044
Iterating global reduction 3 with 10 rules applied. Total rules applied 520 place count 576 transition count 2044
Applied a total of 520 rules in 178 ms. Remains 576 /836 variables (removed 260) and now considering 2044/2304 (removed 260) transitions.
Running 2040 sub problems to find dead transitions.
[2024-05-27 23:27:43] [INFO ] Flow matrix only has 2004 transitions (discarded 40 similar events)
// Phase 1: matrix 2004 rows 576 cols
[2024-05-27 23:27:43] [INFO ] Computed 44 invariants in 62 ms
[2024-05-27 23:27:43] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/572 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2040 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/572 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 2040 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 572/2580 variables, and 40 constraints, problems are : Problem set: 0 solved, 2040 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/576 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2040/2040 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2040 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/572 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2040 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/572 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 2040 unsolved
[2024-05-27 23:28:20] [INFO ] Deduced a trap composed of 48 places in 118 ms of which 2 ms to minimize.
[2024-05-27 23:28:20] [INFO ] Deduced a trap composed of 48 places in 118 ms of which 1 ms to minimize.
[2024-05-27 23:28:20] [INFO ] Deduced a trap composed of 48 places in 99 ms of which 2 ms to minimize.
[2024-05-27 23:28:20] [INFO ] Deduced a trap composed of 48 places in 81 ms of which 1 ms to minimize.
[2024-05-27 23:28:20] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 0 ms to minimize.
[2024-05-27 23:28:20] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 1 ms to minimize.
[2024-05-27 23:28:21] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 0 ms to minimize.
[2024-05-27 23:28:21] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 1 ms to minimize.
[2024-05-27 23:28:21] [INFO ] Deduced a trap composed of 48 places in 64 ms of which 1 ms to minimize.
[2024-05-27 23:28:21] [INFO ] Deduced a trap composed of 264 places in 386 ms of which 3 ms to minimize.
[2024-05-27 23:28:22] [INFO ] Deduced a trap composed of 255 places in 397 ms of which 4 ms to minimize.
[2024-05-27 23:28:22] [INFO ] Deduced a trap composed of 46 places in 216 ms of which 2 ms to minimize.
[2024-05-27 23:28:23] [INFO ] Deduced a trap composed of 23 places in 190 ms of which 2 ms to minimize.
[2024-05-27 23:28:23] [INFO ] Deduced a trap composed of 216 places in 388 ms of which 4 ms to minimize.
[2024-05-27 23:28:26] [INFO ] Deduced a trap composed of 48 places in 87 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/2580 variables, and 55 constraints, problems are : Problem set: 0 solved, 2040 unsolved in 20047 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/576 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2040 constraints, Known Traps: 15/15 constraints]
After SMT, in 54952ms problems are : Problem set: 0 solved, 2040 unsolved
Search for dead transitions found 0 dead transitions in 54978ms
[2024-05-27 23:28:38] [INFO ] Flow matrix only has 2004 transitions (discarded 40 similar events)
[2024-05-27 23:28:38] [INFO ] Invariant cache hit.
[2024-05-27 23:28:39] [INFO ] Implicit Places using invariants in 936 ms returned []
[2024-05-27 23:28:39] [INFO ] Flow matrix only has 2004 transitions (discarded 40 similar events)
[2024-05-27 23:28:39] [INFO ] Invariant cache hit.
[2024-05-27 23:28:40] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-27 23:28:54] [INFO ] Implicit Places using invariants and state equation in 15033 ms returned []
Implicit Place search using SMT with State Equation took 15972 ms to find 0 implicit places.
[2024-05-27 23:28:54] [INFO ] Redundant transitions in 26 ms returned []
Running 2040 sub problems to find dead transitions.
[2024-05-27 23:28:54] [INFO ] Flow matrix only has 2004 transitions (discarded 40 similar events)
[2024-05-27 23:28:54] [INFO ] Invariant cache hit.
[2024-05-27 23:28:54] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/572 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2040 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/572 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 2040 unsolved
[2024-05-27 23:29:28] [INFO ] Deduced a trap composed of 48 places in 123 ms of which 2 ms to minimize.
[2024-05-27 23:29:28] [INFO ] Deduced a trap composed of 48 places in 111 ms of which 1 ms to minimize.
[2024-05-27 23:29:28] [INFO ] Deduced a trap composed of 48 places in 81 ms of which 1 ms to minimize.
[2024-05-27 23:29:28] [INFO ] Deduced a trap composed of 48 places in 77 ms of which 1 ms to minimize.
[2024-05-27 23:29:28] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 1 ms to minimize.
[2024-05-27 23:29:28] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 1 ms to minimize.
[2024-05-27 23:29:28] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 1 ms to minimize.
[2024-05-27 23:29:28] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 1 ms to minimize.
[2024-05-27 23:29:29] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 1 ms to minimize.
[2024-05-27 23:29:29] [INFO ] Deduced a trap composed of 268 places in 416 ms of which 4 ms to minimize.
[2024-05-27 23:29:30] [INFO ] Deduced a trap composed of 249 places in 507 ms of which 5 ms to minimize.
[2024-05-27 23:29:31] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 1 ms to minimize.
[2024-05-27 23:29:35] [INFO ] Deduced a trap composed of 346 places in 399 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 572/2580 variables, and 53 constraints, problems are : Problem set: 0 solved, 2040 unsolved in 30078 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/576 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2040/2040 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2040 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/572 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2040 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/572 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 2040 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/572 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 2040 unsolved
[2024-05-27 23:29:49] [INFO ] Deduced a trap composed of 46 places in 170 ms of which 2 ms to minimize.
[2024-05-27 23:29:49] [INFO ] Deduced a trap composed of 44 places in 184 ms of which 2 ms to minimize.
[2024-05-27 23:29:50] [INFO ] Deduced a trap composed of 24 places in 198 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/2580 variables, and 56 constraints, problems are : Problem set: 0 solved, 2040 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/576 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2040 constraints, Known Traps: 16/16 constraints]
After SMT, in 76142ms problems are : Problem set: 0 solved, 2040 unsolved
Search for dead transitions found 0 dead transitions in 76168ms
Starting structural reductions in SI_LTL mode, iteration 1 : 576/836 places, 2044/2304 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 147342 ms. Remains : 576/836 places, 2044/2304 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 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 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 211 steps (0 resets) in 6 ms. (30 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 119 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
[2024-05-27 23:30:11] [INFO ] Flow matrix only has 2004 transitions (discarded 40 similar events)
[2024-05-27 23:30:11] [INFO ] Invariant cache hit.
[2024-05-27 23:30:12] [INFO ] [Real]Absence check using 14 positive place invariants in 19 ms returned sat
[2024-05-27 23:30:12] [INFO ] [Real]Absence check using 14 positive and 30 generalized place invariants in 81 ms returned sat
[2024-05-27 23:30:14] [INFO ] [Real]Absence check using state equation in 2565 ms returned sat
[2024-05-27 23:30:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 23:30:15] [INFO ] [Nat]Absence check using 14 positive place invariants in 17 ms returned sat
[2024-05-27 23:30:15] [INFO ] [Nat]Absence check using 14 positive and 30 generalized place invariants in 220 ms returned sat
[2024-05-27 23:30:20] [INFO ] [Nat]Absence check using state equation in 4148 ms returned sat
[2024-05-27 23:30:20] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-27 23:30:20] [INFO ] [Nat]Added 200 Read/Feed constraints in 510 ms returned sat
[2024-05-27 23:30:21] [INFO ] Deduced a trap composed of 46 places in 389 ms of which 4 ms to minimize.
[2024-05-27 23:30:21] [INFO ] Deduced a trap composed of 48 places in 122 ms of which 1 ms to minimize.
[2024-05-27 23:30:22] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 2252 ms
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1692 reset in 525 ms.
Product exploration explored 100000 steps with 1685 reset in 550 ms.
Support contains 10 out of 576 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 576/576 places, 2044/2044 transitions.
Applied a total of 0 rules in 34 ms. Remains 576 /576 variables (removed 0) and now considering 2044/2044 (removed 0) transitions.
Running 2040 sub problems to find dead transitions.
[2024-05-27 23:30:24] [INFO ] Flow matrix only has 2004 transitions (discarded 40 similar events)
[2024-05-27 23:30:24] [INFO ] Invariant cache hit.
[2024-05-27 23:30:24] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/572 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2040 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/572 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 2040 unsolved
[2024-05-27 23:30:57] [INFO ] Deduced a trap composed of 48 places in 112 ms of which 2 ms to minimize.
[2024-05-27 23:30:57] [INFO ] Deduced a trap composed of 48 places in 124 ms of which 1 ms to minimize.
[2024-05-27 23:30:57] [INFO ] Deduced a trap composed of 48 places in 92 ms of which 1 ms to minimize.
[2024-05-27 23:30:57] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 1 ms to minimize.
[2024-05-27 23:30:57] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 0 ms to minimize.
[2024-05-27 23:30:57] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 1 ms to minimize.
[2024-05-27 23:30:57] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 1 ms to minimize.
[2024-05-27 23:30:57] [INFO ] Deduced a trap composed of 48 places in 47 ms of which 1 ms to minimize.
[2024-05-27 23:30:57] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 1 ms to minimize.
[2024-05-27 23:30:58] [INFO ] Deduced a trap composed of 268 places in 386 ms of which 3 ms to minimize.
[2024-05-27 23:30:58] [INFO ] Deduced a trap composed of 249 places in 384 ms of which 3 ms to minimize.
[2024-05-27 23:31:00] [INFO ] Deduced a trap composed of 48 places in 36 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 572/2580 variables, and 52 constraints, problems are : Problem set: 0 solved, 2040 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/576 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2040/2040 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2040 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/572 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2040 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/572 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 2040 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/572 variables, 12/52 constraints. Problems are: Problem set: 0 solved, 2040 unsolved
[2024-05-27 23:31:02] [INFO ] Deduced a trap composed of 24 places in 171 ms of which 2 ms to minimize.
[2024-05-27 23:31:08] [INFO ] Deduced a trap composed of 231 places in 383 ms of which 4 ms to minimize.
[2024-05-27 23:31:08] [INFO ] Deduced a trap composed of 229 places in 558 ms of which 5 ms to minimize.
[2024-05-27 23:31:12] [INFO ] Deduced a trap composed of 310 places in 3335 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/2580 variables, and 56 constraints, problems are : Problem set: 0 solved, 2040 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/576 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2040 constraints, Known Traps: 16/16 constraints]
After SMT, in 56265ms problems are : Problem set: 0 solved, 2040 unsolved
Search for dead transitions found 0 dead transitions in 56290ms
[2024-05-27 23:31:20] [INFO ] Flow matrix only has 2004 transitions (discarded 40 similar events)
[2024-05-27 23:31:20] [INFO ] Invariant cache hit.
[2024-05-27 23:31:20] [INFO ] Implicit Places using invariants in 558 ms returned []
[2024-05-27 23:31:20] [INFO ] Flow matrix only has 2004 transitions (discarded 40 similar events)
[2024-05-27 23:31:20] [INFO ] Invariant cache hit.
[2024-05-27 23:31:21] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-27 23:31:36] [INFO ] Implicit Places using invariants and state equation in 15493 ms returned []
Implicit Place search using SMT with State Equation took 16067 ms to find 0 implicit places.
[2024-05-27 23:31:36] [INFO ] Redundant transitions in 48 ms returned []
Running 2040 sub problems to find dead transitions.
[2024-05-27 23:31:36] [INFO ] Flow matrix only has 2004 transitions (discarded 40 similar events)
[2024-05-27 23:31:36] [INFO ] Invariant cache hit.
[2024-05-27 23:31:36] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/572 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2040 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/572 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 2040 unsolved
[2024-05-27 23:32:10] [INFO ] Deduced a trap composed of 48 places in 148 ms of which 2 ms to minimize.
[2024-05-27 23:32:10] [INFO ] Deduced a trap composed of 48 places in 147 ms of which 2 ms to minimize.
[2024-05-27 23:32:10] [INFO ] Deduced a trap composed of 48 places in 110 ms of which 2 ms to minimize.
[2024-05-27 23:32:10] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 1 ms to minimize.
[2024-05-27 23:32:10] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 0 ms to minimize.
[2024-05-27 23:32:10] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 1 ms to minimize.
[2024-05-27 23:32:10] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 1 ms to minimize.
[2024-05-27 23:32:10] [INFO ] Deduced a trap composed of 48 places in 44 ms of which 1 ms to minimize.
[2024-05-27 23:32:10] [INFO ] Deduced a trap composed of 48 places in 45 ms of which 1 ms to minimize.
[2024-05-27 23:32:11] [INFO ] Deduced a trap composed of 268 places in 530 ms of which 5 ms to minimize.
[2024-05-27 23:32:12] [INFO ] Deduced a trap composed of 249 places in 441 ms of which 3 ms to minimize.
[2024-05-27 23:32:13] [INFO ] Deduced a trap composed of 48 places in 59 ms of which 1 ms to minimize.
[2024-05-27 23:32:18] [INFO ] Deduced a trap composed of 346 places in 496 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 572/2580 variables, and 53 constraints, problems are : Problem set: 0 solved, 2040 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/576 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2040/2040 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2040 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/572 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2040 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/572 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 2040 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/572 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 2040 unsolved
[2024-05-27 23:32:31] [INFO ] Deduced a trap composed of 46 places in 201 ms of which 3 ms to minimize.
[2024-05-27 23:32:31] [INFO ] Deduced a trap composed of 44 places in 181 ms of which 3 ms to minimize.
[2024-05-27 23:32:32] [INFO ] Deduced a trap composed of 24 places in 185 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/2580 variables, and 56 constraints, problems are : Problem set: 0 solved, 2040 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/576 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2040 constraints, Known Traps: 16/16 constraints]
After SMT, in 76291ms problems are : Problem set: 0 solved, 2040 unsolved
Search for dead transitions found 0 dead transitions in 76320ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 148783 ms. Remains : 576/576 places, 2044/2044 transitions.
Treatment of property PolyORBLF-COL-S04J04T10-LTLFireability-02 finished in 463708 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((G(p0) U p1))))'
Support contains 31 out of 856 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 856/856 places, 2324/2324 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 856 transition count 2254
Reduce places removed 70 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 80 rules applied. Total rules applied 150 place count 786 transition count 2244
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 160 place count 776 transition count 2244
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 160 place count 776 transition count 2144
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 360 place count 676 transition count 2144
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 370 place count 666 transition count 2134
Iterating global reduction 3 with 10 rules applied. Total rules applied 380 place count 666 transition count 2134
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 580 place count 566 transition count 2034
Applied a total of 580 rules in 121 ms. Remains 566 /856 variables (removed 290) and now considering 2034/2324 (removed 290) transitions.
Running 2030 sub problems to find dead transitions.
[2024-05-27 23:32:53] [INFO ] Flow matrix only has 1994 transitions (discarded 40 similar events)
// Phase 1: matrix 1994 rows 566 cols
[2024-05-27 23:32:53] [INFO ] Computed 44 invariants in 55 ms
[2024-05-27 23:32:53] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/562 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2030 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/562 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 2030 unsolved
[2024-05-27 23:33:25] [INFO ] Deduced a trap composed of 47 places in 177 ms of which 3 ms to minimize.
[2024-05-27 23:33:25] [INFO ] Deduced a trap composed of 47 places in 138 ms of which 2 ms to minimize.
[2024-05-27 23:33:26] [INFO ] Deduced a trap composed of 47 places in 87 ms of which 1 ms to minimize.
[2024-05-27 23:33:26] [INFO ] Deduced a trap composed of 47 places in 115 ms of which 1 ms to minimize.
[2024-05-27 23:33:26] [INFO ] Deduced a trap composed of 47 places in 97 ms of which 2 ms to minimize.
[2024-05-27 23:33:26] [INFO ] Deduced a trap composed of 47 places in 79 ms of which 1 ms to minimize.
[2024-05-27 23:33:26] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 1 ms to minimize.
[2024-05-27 23:33:26] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 1 ms to minimize.
[2024-05-27 23:33:26] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 1 ms to minimize.
[2024-05-27 23:33:26] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 1 ms to minimize.
[2024-05-27 23:33:27] [INFO ] Deduced a trap composed of 273 places in 471 ms of which 4 ms to minimize.
[2024-05-27 23:33:27] [INFO ] Deduced a trap composed of 222 places in 463 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 (/ 19.0 2.0))
(s1 (/ 1.0 2.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 1.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 3.0)
(s20 1.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 1.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 1.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 9.0)
(s183 (/ 1.0 2.0))
(s184 (/ 1.0 2.0))
(s185 1.0)
(s186 0.0)
(s187 0.0)
(s188 1.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 2.0))
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 (/ 1.0 2.0))
(s251 (/ 1.0 2.0))
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 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 (/ 1.0 2.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 1.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 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 1.0)
(s355 1.0)
(s356 (/ 1.0 2.0))
(s357 1.0)
(s358 1.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 4.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 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 562/2560 variables, and 52 constraints, problems are : Problem set: 0 solved, 2030 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/566 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2030/2030 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2030 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/562 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2030 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/562 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 2030 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/562 variables, 12/52 constraints. Problems are: Problem set: 0 solved, 2030 unsolved
[2024-05-27 23:33:35] [INFO ] Deduced a trap composed of 23 places in 197 ms of which 3 ms to minimize.
[2024-05-27 23:33:42] [INFO ] Deduced a trap composed of 300 places in 423 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 562/2560 variables, and 54 constraints, problems are : Problem set: 0 solved, 2030 unsolved in 20053 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/566 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2030 constraints, Known Traps: 14/14 constraints]
After SMT, in 55968ms problems are : Problem set: 0 solved, 2030 unsolved
Search for dead transitions found 0 dead transitions in 55993ms
[2024-05-27 23:33:49] [INFO ] Flow matrix only has 1994 transitions (discarded 40 similar events)
[2024-05-27 23:33:49] [INFO ] Invariant cache hit.
[2024-05-27 23:33:49] [INFO ] Implicit Places using invariants in 571 ms returned []
[2024-05-27 23:33:49] [INFO ] Flow matrix only has 1994 transitions (discarded 40 similar events)
[2024-05-27 23:33:49] [INFO ] Invariant cache hit.
[2024-05-27 23:33:50] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-27 23:34:02] [INFO ] Implicit Places using invariants and state equation in 12814 ms returned []
Implicit Place search using SMT with State Equation took 13408 ms to find 0 implicit places.
[2024-05-27 23:34:02] [INFO ] Redundant transitions in 49 ms returned []
Running 2030 sub problems to find dead transitions.
[2024-05-27 23:34:02] [INFO ] Flow matrix only has 1994 transitions (discarded 40 similar events)
[2024-05-27 23:34:02] [INFO ] Invariant cache hit.
[2024-05-27 23:34:02] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/562 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2030 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/562 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 2030 unsolved
[2024-05-27 23:34:34] [INFO ] Deduced a trap composed of 47 places in 95 ms of which 3 ms to minimize.
[2024-05-27 23:34:34] [INFO ] Deduced a trap composed of 47 places in 73 ms of which 1 ms to minimize.
[2024-05-27 23:34:34] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 1 ms to minimize.
[2024-05-27 23:34:34] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 1 ms to minimize.
[2024-05-27 23:34:34] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 1 ms to minimize.
[2024-05-27 23:34:34] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 1 ms to minimize.
[2024-05-27 23:34:34] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 1 ms to minimize.
[2024-05-27 23:34:34] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
[2024-05-27 23:34:34] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 1 ms to minimize.
[2024-05-27 23:34:35] [INFO ] Deduced a trap composed of 254 places in 515 ms of which 4 ms to minimize.
[2024-05-27 23:34:35] [INFO ] Deduced a trap composed of 222 places in 453 ms of which 3 ms to minimize.
[2024-05-27 23:34:37] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 2 ms to minimize.
[2024-05-27 23:34:40] [INFO ] Deduced a trap composed of 300 places in 443 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 562/2560 variables, and 53 constraints, problems are : Problem set: 0 solved, 2030 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/566 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2030/2030 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2030 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/562 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2030 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/562 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 2030 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/562 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 2030 unsolved
[2024-05-27 23:34:54] [INFO ] Deduced a trap composed of 93 places in 347 ms of which 3 ms to minimize.
[2024-05-27 23:34:57] [INFO ] Deduced a trap composed of 47 places in 159 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 562/2560 variables, and 55 constraints, problems are : Problem set: 0 solved, 2030 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/566 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2030 constraints, Known Traps: 15/15 constraints]
After SMT, in 75169ms problems are : Problem set: 0 solved, 2030 unsolved
Search for dead transitions found 0 dead transitions in 75198ms
Starting structural reductions in SI_LTL mode, iteration 1 : 566/856 places, 2034/2324 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 144795 ms. Remains : 566/856 places, 2034/2324 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : PolyORBLF-COL-S04J04T10-LTLFireability-03
Stuttering criterion allowed to conclude after 4968 steps with 0 reset in 46 ms.
FORMULA PolyORBLF-COL-S04J04T10-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S04J04T10-LTLFireability-03 finished in 144976 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))'
Support contains 51 out of 856 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 856/856 places, 2324/2324 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 846 transition count 2314
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 846 transition count 2314
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 836 transition count 2304
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 836 transition count 2304
Applied a total of 40 rules in 42 ms. Remains 836 /856 variables (removed 20) and now considering 2304/2324 (removed 20) transitions.
Running 2300 sub problems to find dead transitions.
[2024-05-27 23:35:17] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
// Phase 1: matrix 2264 rows 836 cols
[2024-05-27 23:35:17] [INFO ] Computed 44 invariants in 35 ms
[2024-05-27 23:35:18] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
SMT process timed out in 35513ms, After SMT, problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 35543ms
[2024-05-27 23:35:53] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-05-27 23:35:53] [INFO ] Invariant cache hit.
[2024-05-27 23:35:54] [INFO ] Implicit Places using invariants in 745 ms returned []
[2024-05-27 23:35:54] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-05-27 23:35:54] [INFO ] Invariant cache hit.
[2024-05-27 23:35:55] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-27 23:36:25] [INFO ] Implicit Places using invariants and state equation in 31683 ms returned []
Implicit Place search using SMT with State Equation took 32431 ms to find 0 implicit places.
Running 2300 sub problems to find dead transitions.
[2024-05-27 23:36:25] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-05-27 23:36:25] [INFO ] Invariant cache hit.
[2024-05-27 23:36:25] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/832 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
[2024-05-27 23:37:06] [INFO ] Deduced a trap composed of 74 places in 119 ms of which 2 ms to minimize.
[2024-05-27 23:37:06] [INFO ] Deduced a trap composed of 74 places in 73 ms of which 2 ms to minimize.
[2024-05-27 23:37:06] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 1 ms to minimize.
[2024-05-27 23:37:06] [INFO ] Deduced a trap composed of 74 places in 65 ms of which 1 ms to minimize.
[2024-05-27 23:37:06] [INFO ] Deduced a trap composed of 74 places in 76 ms of which 2 ms to minimize.
[2024-05-27 23:37:06] [INFO ] Deduced a trap composed of 74 places in 74 ms of which 1 ms to minimize.
[2024-05-27 23:37:06] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 1 ms to minimize.
[2024-05-27 23:37:06] [INFO ] Deduced a trap composed of 74 places in 65 ms of which 1 ms to minimize.
[2024-05-27 23:37:06] [INFO ] Deduced a trap composed of 74 places in 67 ms of which 1 ms to minimize.
[2024-05-27 23:37:07] [INFO ] Deduced a trap composed of 489 places in 510 ms of which 6 ms to minimize.
[2024-05-27 23:37:08] [INFO ] Deduced a trap composed of 511 places in 513 ms of which 6 ms to minimize.
[2024-05-27 23:37:09] [INFO ] Deduced a trap composed of 223 places in 545 ms of which 6 ms to minimize.
[2024-05-27 23:37:09] [INFO ] Deduced a trap composed of 74 places in 67 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 832/3100 variables, and 44 constraints, problems are : Problem set: 0 solved, 2300 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 9/11 constraints, Generalized P Invariants (flows): 22/33 constraints, State Equation: 0/836 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2300/2300 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/832 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/832 variables, 13/44 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
[2024-05-27 23:37:19] [INFO ] Deduced a trap composed of 411 places in 545 ms of which 6 ms to minimize.
[2024-05-27 23:37:22] [INFO ] Deduced a trap composed of 579 places in 606 ms of which 6 ms to minimize.
[2024-05-27 23:37:23] [INFO ] Deduced a trap composed of 510 places in 514 ms of which 5 ms to minimize.
[2024-05-27 23:37:23] [INFO ] Deduced a trap composed of 498 places in 453 ms of which 4 ms to minimize.
[2024-05-27 23:37:24] [INFO ] Deduced a trap composed of 507 places in 452 ms of which 4 ms to minimize.
[2024-05-27 23:37:28] [INFO ] Deduced a trap composed of 455 places in 570 ms of which 6 ms to minimize.
[2024-05-27 23:37:28] [INFO ] Deduced a trap composed of 480 places in 513 ms of which 6 ms to minimize.
[2024-05-27 23:37:29] [INFO ] Deduced a trap composed of 492 places in 461 ms of which 5 ms to minimize.
[2024-05-27 23:37:34] [INFO ] Deduced a trap composed of 79 places in 367 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 832/3100 variables, and 53 constraints, problems are : Problem set: 0 solved, 2300 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 9/11 constraints, Generalized P Invariants (flows): 22/33 constraints, State Equation: 0/836 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2300 constraints, Known Traps: 22/22 constraints]
After SMT, in 75366ms problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 75395ms
Starting structural reductions in LTL mode, iteration 1 : 836/856 places, 2304/2324 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 143423 ms. Remains : 836/856 places, 2304/2324 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : PolyORBLF-COL-S04J04T10-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-COL-S04J04T10-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S04J04T10-LTLFireability-05 finished in 143541 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 p1)&&F((p2||X(p3)))))'
Support contains 82 out of 856 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 856/856 places, 2324/2324 transitions.
Applied a total of 0 rules in 12 ms. Remains 856 /856 variables (removed 0) and now considering 2324/2324 (removed 0) transitions.
Running 2320 sub problems to find dead transitions.
[2024-05-27 23:37:41] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
// Phase 1: matrix 2284 rows 856 cols
[2024-05-27 23:37:41] [INFO ] Computed 44 invariants in 61 ms
[2024-05-27 23:37:41] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/852 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2320 unsolved
SMT process timed out in 35508ms, After SMT, problems are : Problem set: 0 solved, 2320 unsolved
Search for dead transitions found 0 dead transitions in 35535ms
[2024-05-27 23:38:16] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
[2024-05-27 23:38:16] [INFO ] Invariant cache hit.
[2024-05-27 23:38:17] [INFO ] Implicit Places using invariants in 765 ms returned []
[2024-05-27 23:38:17] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
[2024-05-27 23:38:17] [INFO ] Invariant cache hit.
[2024-05-27 23:38:18] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-27 23:38:36] [INFO ] Implicit Places using invariants and state equation in 19175 ms returned []
Implicit Place search using SMT with State Equation took 19943 ms to find 0 implicit places.
Running 2320 sub problems to find dead transitions.
[2024-05-27 23:38:36] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
[2024-05-27 23:38:36] [INFO ] Invariant cache hit.
[2024-05-27 23:38:36] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/852 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/852 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 2320 unsolved
[2024-05-27 23:39:17] [INFO ] Deduced a trap composed of 76 places in 63 ms of which 1 ms to minimize.
[2024-05-27 23:39:17] [INFO ] Deduced a trap composed of 76 places in 80 ms of which 1 ms to minimize.
[2024-05-27 23:39:17] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 1 ms to minimize.
[2024-05-27 23:39:17] [INFO ] Deduced a trap composed of 76 places in 82 ms of which 1 ms to minimize.
[2024-05-27 23:39:19] [INFO ] Deduced a trap composed of 76 places in 545 ms of which 9 ms to minimize.
[2024-05-27 23:39:19] [INFO ] Deduced a trap composed of 266 places in 606 ms of which 7 ms to minimize.
[2024-05-27 23:39:22] [INFO ] Deduced a trap composed of 521 places in 579 ms of which 7 ms to minimize.
SMT process timed out in 45050ms, After SMT, problems are : Problem set: 0 solved, 2320 unsolved
Search for dead transitions found 0 dead transitions in 45079ms
Finished structural reductions in LTL mode , in 1 iterations and 100583 ms. Remains : 856/856 places, 2324/2324 transitions.
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p0), (NOT p1), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : PolyORBLF-COL-S04J04T10-LTLFireability-07
Product exploration explored 100000 steps with 3148 reset in 763 ms.
Product exploration explored 100000 steps with 3189 reset in 592 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 p1) (NOT p0) p2 (NOT p3)), (X p2), (X (NOT p3)), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 125 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 252 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), false, false, false]
RANDOM walk for 40000 steps (9 resets) in 351 ms. (113 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1434 ms. (27 steps per ms) remains 1/1 properties
[2024-05-27 23:39:24] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
[2024-05-27 23:39:24] [INFO ] Invariant cache hit.
[2024-05-27 23:39:24] [INFO ] State equation strengthened by 200 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 35/96 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/100 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 114/214 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/223 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 609/832 variables, 18/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 23:39:25] [INFO ] Deduced a trap composed of 76 places in 265 ms of which 4 ms to minimize.
[2024-05-27 23:39:25] [INFO ] Deduced a trap composed of 76 places in 260 ms of which 4 ms to minimize.
[2024-05-27 23:39:25] [INFO ] Deduced a trap composed of 76 places in 179 ms of which 3 ms to minimize.
[2024-05-27 23:39:25] [INFO ] Deduced a trap composed of 77 places in 154 ms of which 2 ms to minimize.
[2024-05-27 23:39:25] [INFO ] Deduced a trap composed of 77 places in 146 ms of which 2 ms to minimize.
[2024-05-27 23:39:26] [INFO ] Deduced a trap composed of 77 places in 105 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/832 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/832 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/836 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 23:39:26] [INFO ] Deduced a trap composed of 77 places in 121 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/836 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/836 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Real declared 854/3140 variables, and 50 constraints, problems are : Problem set: 1 solved, 0 unsolved in 1985 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 0/856 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 2031ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2 (NOT p3)), (X p2), (X (NOT p3)), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 14 factoid took 316 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter insensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 280 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), false, false, false]
Stuttering acceptance computed with spot in 234 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), false, false, false]
[2024-05-27 23:39:27] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
[2024-05-27 23:39:27] [INFO ] Invariant cache hit.
[2024-05-27 23:39:28] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-27 23:39:28] [INFO ] [Real]Absence check using 13 positive and 31 generalized place invariants in 152 ms returned sat
[2024-05-27 23:39:31] [INFO ] [Real]Absence check using state equation in 2679 ms returned sat
[2024-05-27 23:39:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 23:39:32] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-27 23:39:32] [INFO ] [Nat]Absence check using 13 positive and 31 generalized place invariants in 144 ms returned sat
[2024-05-27 23:39:38] [INFO ] [Nat]Absence check using state equation in 5207 ms returned sat
[2024-05-27 23:39:38] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-27 23:39:39] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 23:39:40] [INFO ] [Nat]Added 200 Read/Feed constraints in 1903 ms returned sat
[2024-05-27 23:39:40] [INFO ] Computed and/alt/rep : 1350/3496/1320 causal constraints (skipped 960 transitions) in 310 ms.
[2024-05-27 23:39:43] [INFO ] Added : 25 causal constraints over 5 iterations in 3575 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-27 23:39:43] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
[2024-05-27 23:39:43] [INFO ] Invariant cache hit.
[2024-05-27 23:39:45] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 23:39:45] [INFO ] [Real]Absence check using 13 positive and 31 generalized place invariants in 97 ms returned sat
[2024-05-27 23:39:47] [INFO ] [Real]Absence check using state equation in 1976 ms returned sat
[2024-05-27 23:39:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 23:39:48] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-27 23:39:49] [INFO ] [Nat]Absence check using 13 positive and 31 generalized place invariants in 140 ms returned sat
[2024-05-27 23:39:54] [INFO ] [Nat]Absence check using state equation in 5807 ms returned sat
[2024-05-27 23:39:54] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-27 23:39:56] [INFO ] [Nat]Added 200 Read/Feed constraints in 1264 ms returned sat
[2024-05-27 23:39:56] [INFO ] Deduced a trap composed of 76 places in 101 ms of which 2 ms to minimize.
[2024-05-27 23:39:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 613 ms
[2024-05-27 23:39:56] [INFO ] Computed and/alt/rep : 1350/3496/1320 causal constraints (skipped 960 transitions) in 239 ms.
Could not prove EG (NOT p1)
Support contains 61 out of 856 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 856/856 places, 2324/2324 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 856 transition count 2254
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 140 place count 786 transition count 2254
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 140 place count 786 transition count 2154
Deduced a syphon composed of 100 places in 2 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 340 place count 686 transition count 2154
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 350 place count 676 transition count 2144
Iterating global reduction 2 with 10 rules applied. Total rules applied 360 place count 676 transition count 2144
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 3 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 520 place count 596 transition count 2064
Applied a total of 520 rules in 137 ms. Remains 596 /856 variables (removed 260) and now considering 2064/2324 (removed 260) transitions.
Running 2060 sub problems to find dead transitions.
[2024-05-27 23:40:02] [INFO ] Flow matrix only has 2024 transitions (discarded 40 similar events)
// Phase 1: matrix 2024 rows 596 cols
[2024-05-27 23:40:02] [INFO ] Computed 44 invariants in 41 ms
[2024-05-27 23:40:02] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2060 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 2060 unsolved
[2024-05-27 23:40:33] [INFO ] Deduced a trap composed of 50 places in 146 ms of which 2 ms to minimize.
[2024-05-27 23:40:33] [INFO ] Deduced a trap composed of 50 places in 126 ms of which 2 ms to minimize.
[2024-05-27 23:40:33] [INFO ] Deduced a trap composed of 50 places in 95 ms of which 2 ms to minimize.
[2024-05-27 23:40:33] [INFO ] Deduced a trap composed of 50 places in 96 ms of which 2 ms to minimize.
[2024-05-27 23:40:33] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 1 ms to minimize.
[2024-05-27 23:40:33] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 1 ms to minimize.
[2024-05-27 23:40:33] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
[2024-05-27 23:40:33] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 1 ms to minimize.
[2024-05-27 23:40:33] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 1 ms to minimize.
[2024-05-27 23:40:34] [INFO ] Deduced a trap composed of 245 places in 412 ms of which 4 ms to minimize.
[2024-05-27 23:40:35] [INFO ] Deduced a trap composed of 261 places in 545 ms of which 4 ms to minimize.
[2024-05-27 23:40:35] [INFO ] Deduced a trap composed of 23 places in 535 ms of which 5 ms to minimize.
[2024-05-27 23:40:36] [INFO ] Deduced a trap composed of 256 places in 489 ms of which 4 ms to minimize.
[2024-05-27 23:40:36] [INFO ] Deduced a trap composed of 293 places in 455 ms of which 3 ms to minimize.
[2024-05-27 23:40:37] [INFO ] Deduced a trap composed of 269 places in 506 ms of which 4 ms to minimize.
[2024-05-27 23:40:37] [INFO ] Deduced a trap composed of 236 places in 504 ms of which 4 ms to minimize.
[2024-05-27 23:40:38] [INFO ] Deduced a trap composed of 245 places in 432 ms of which 3 ms to minimize.
SMT process timed out in 35784ms, After SMT, problems are : Problem set: 0 solved, 2060 unsolved
Search for dead transitions found 0 dead transitions in 35812ms
[2024-05-27 23:40:38] [INFO ] Flow matrix only has 2024 transitions (discarded 40 similar events)
[2024-05-27 23:40:38] [INFO ] Invariant cache hit.
[2024-05-27 23:40:38] [INFO ] Implicit Places using invariants in 605 ms returned []
[2024-05-27 23:40:38] [INFO ] Flow matrix only has 2024 transitions (discarded 40 similar events)
[2024-05-27 23:40:38] [INFO ] Invariant cache hit.
[2024-05-27 23:40:40] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-27 23:40:59] [INFO ] Implicit Places using invariants and state equation in 20753 ms returned []
Implicit Place search using SMT with State Equation took 21360 ms to find 0 implicit places.
[2024-05-27 23:40:59] [INFO ] Redundant transitions in 39 ms returned []
Running 2060 sub problems to find dead transitions.
[2024-05-27 23:40:59] [INFO ] Flow matrix only has 2024 transitions (discarded 40 similar events)
[2024-05-27 23:40:59] [INFO ] Invariant cache hit.
[2024-05-27 23:40:59] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2060 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 2060 unsolved
[2024-05-27 23:41:31] [INFO ] Deduced a trap composed of 50 places in 154 ms of which 3 ms to minimize.
[2024-05-27 23:41:32] [INFO ] Deduced a trap composed of 50 places in 135 ms of which 2 ms to minimize.
[2024-05-27 23:41:32] [INFO ] Deduced a trap composed of 50 places in 110 ms of which 2 ms to minimize.
[2024-05-27 23:41:32] [INFO ] Deduced a trap composed of 50 places in 105 ms of which 1 ms to minimize.
[2024-05-27 23:41:32] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 1 ms to minimize.
[2024-05-27 23:41:32] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 1 ms to minimize.
[2024-05-27 23:41:32] [INFO ] Deduced a trap composed of 50 places in 44 ms of which 1 ms to minimize.
[2024-05-27 23:41:32] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 1 ms to minimize.
[2024-05-27 23:41:32] [INFO ] Deduced a trap composed of 50 places in 66 ms of which 1 ms to minimize.
[2024-05-27 23:41:33] [INFO ] Deduced a trap composed of 239 places in 445 ms of which 4 ms to minimize.
[2024-05-27 23:41:34] [INFO ] Deduced a trap composed of 232 places in 430 ms of which 4 ms to minimize.
[2024-05-27 23:41:34] [INFO ] Deduced a trap composed of 240 places in 437 ms of which 4 ms to minimize.
[2024-05-27 23:41:35] [INFO ] Deduced a trap composed of 223 places in 481 ms of which 4 ms to minimize.
[2024-05-27 23:41:37] [INFO ] Deduced a trap composed of 77 places in 278 ms of which 2 ms to minimize.
[2024-05-27 23:41:37] [INFO ] Deduced a trap composed of 50 places in 66 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2620 variables, and 55 constraints, problems are : Problem set: 0 solved, 2060 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 11/13 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/596 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2060/2060 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2060 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2060 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 2060 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 2060 unsolved
[2024-05-27 23:41:59] [INFO ] Deduced a trap composed of 330 places in 516 ms of which 4 ms to minimize.
[2024-05-27 23:42:01] [INFO ] Deduced a trap composed of 23 places in 233 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 592/2620 variables, and 57 constraints, problems are : Problem set: 0 solved, 2060 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 11/13 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/596 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2060 constraints, Known Traps: 17/17 constraints]
After SMT, in 74880ms problems are : Problem set: 0 solved, 2060 unsolved
Search for dead transitions found 0 dead transitions in 74910ms
Starting structural reductions in SI_LTL mode, iteration 1 : 596/856 places, 2064/2324 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 132281 ms. Remains : 596/856 places, 2064/2324 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 137 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter insensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), false, false, false]
RANDOM walk for 40000 steps (10 resets) in 523 ms. (76 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 424 ms. (94 steps per ms) remains 1/1 properties
[2024-05-27 23:42:15] [INFO ] Flow matrix only has 2024 transitions (discarded 40 similar events)
[2024-05-27 23:42:15] [INFO ] Invariant cache hit.
[2024-05-27 23:42:15] [INFO ] State equation strengthened by 200 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 74/163 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 12/175 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 398/573 variables, 19/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 23:42:15] [INFO ] Deduced a trap composed of 50 places in 144 ms of which 2 ms to minimize.
[2024-05-27 23:42:15] [INFO ] Deduced a trap composed of 51 places in 152 ms of which 2 ms to minimize.
[2024-05-27 23:42:16] [INFO ] Deduced a trap composed of 50 places in 136 ms of which 2 ms to minimize.
[2024-05-27 23:42:16] [INFO ] Deduced a trap composed of 50 places in 103 ms of which 1 ms to minimize.
[2024-05-27 23:42:16] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 1 ms to minimize.
[2024-05-27 23:42:16] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/573 variables, 6/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/573 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/577 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/577 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 594/2620 variables, and 49 constraints, problems are : Problem set: 1 solved, 0 unsolved in 1208 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 0/596 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 1268ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (G (OR (NOT p1) (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p1) p0))), (F p1), (F (NOT (OR p1 (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 14 factoid took 412 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter insensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 300 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), false, false, false]
Stuttering acceptance computed with spot in 341 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), false, false, false]
[2024-05-27 23:42:17] [INFO ] Flow matrix only has 2024 transitions (discarded 40 similar events)
[2024-05-27 23:42:17] [INFO ] Invariant cache hit.
[2024-05-27 23:42:19] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-27 23:42:19] [INFO ] [Real]Absence check using 13 positive and 31 generalized place invariants in 222 ms returned sat
[2024-05-27 23:42:21] [INFO ] [Real]Absence check using state equation in 2069 ms returned sat
[2024-05-27 23:42:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 23:42:23] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 23:42:23] [INFO ] [Nat]Absence check using 13 positive and 31 generalized place invariants in 110 ms returned sat
[2024-05-27 23:42:26] [INFO ] [Nat]Absence check using state equation in 3016 ms returned sat
[2024-05-27 23:42:26] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-27 23:42:27] [INFO ] [Nat]Added 200 Read/Feed constraints in 1057 ms returned sat
[2024-05-27 23:42:27] [INFO ] Computed and/alt/rep : 990/2806/960 causal constraints (skipped 1060 transitions) in 178 ms.
[2024-05-27 23:42:29] [INFO ] Added : 36 causal constraints over 8 iterations in 1865 ms. Result :sat
Could not prove EG (NOT p1)
[2024-05-27 23:42:29] [INFO ] Flow matrix only has 2024 transitions (discarded 40 similar events)
[2024-05-27 23:42:29] [INFO ] Invariant cache hit.
[2024-05-27 23:42:30] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-27 23:42:30] [INFO ] [Real]Absence check using 13 positive and 31 generalized place invariants in 110 ms returned sat
[2024-05-27 23:42:33] [INFO ] [Real]Absence check using state equation in 3006 ms returned sat
[2024-05-27 23:42:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 23:42:34] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-27 23:42:34] [INFO ] [Nat]Absence check using 13 positive and 31 generalized place invariants in 63 ms returned sat
[2024-05-27 23:42:39] [INFO ] [Nat]Absence check using state equation in 4806 ms returned sat
[2024-05-27 23:42:39] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-27 23:42:40] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 23:42:42] [INFO ] [Nat]Added 200 Read/Feed constraints in 3042 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 322 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), false, false, false]
Product exploration explored 100000 steps with 3794 reset in 799 ms.
Product exploration explored 100000 steps with 3797 reset in 828 ms.
Support contains 61 out of 596 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 596/596 places, 2064/2064 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 596 transition count 2054
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 586 transition count 2054
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 40 place count 576 transition count 2044
Applied a total of 40 rules in 54 ms. Remains 576 /596 variables (removed 20) and now considering 2044/2064 (removed 20) transitions.
Running 2040 sub problems to find dead transitions.
[2024-05-27 23:42:44] [INFO ] Flow matrix only has 2004 transitions (discarded 40 similar events)
// Phase 1: matrix 2004 rows 576 cols
[2024-05-27 23:42:44] [INFO ] Computed 44 invariants in 65 ms
[2024-05-27 23:42:44] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/572 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2040 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/572 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 2040 unsolved
[2024-05-27 23:43:17] [INFO ] Deduced a trap composed of 48 places in 202 ms of which 3 ms to minimize.
[2024-05-27 23:43:17] [INFO ] Deduced a trap composed of 48 places in 122 ms of which 2 ms to minimize.
[2024-05-27 23:43:17] [INFO ] Deduced a trap composed of 48 places in 109 ms of which 1 ms to minimize.
[2024-05-27 23:43:18] [INFO ] Deduced a trap composed of 48 places in 112 ms of which 1 ms to minimize.
[2024-05-27 23:43:18] [INFO ] Deduced a trap composed of 48 places in 80 ms of which 1 ms to minimize.
[2024-05-27 23:43:18] [INFO ] Deduced a trap composed of 48 places in 60 ms of which 1 ms to minimize.
[2024-05-27 23:43:18] [INFO ] Deduced a trap composed of 48 places in 109 ms of which 1 ms to minimize.
[2024-05-27 23:43:18] [INFO ] Deduced a trap composed of 48 places in 91 ms of which 1 ms to minimize.
[2024-05-27 23:43:18] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 1 ms to minimize.
[2024-05-27 23:43:18] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 1 ms to minimize.
[2024-05-27 23:43:19] [INFO ] Deduced a trap composed of 243 places in 443 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 572/2580 variables, and 51 constraints, problems are : Problem set: 0 solved, 2040 unsolved in 20059 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/576 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2040/2040 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2040 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/572 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2040 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/572 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 2040 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/572 variables, 11/51 constraints. Problems are: Problem set: 0 solved, 2040 unsolved
[2024-05-27 23:43:23] [INFO ] Deduced a trap composed of 280 places in 576 ms of which 5 ms to minimize.
[2024-05-27 23:43:24] [INFO ] Deduced a trap composed of 263 places in 539 ms of which 4 ms to minimize.
[2024-05-27 23:43:24] [INFO ] Deduced a trap composed of 23 places in 524 ms of which 5 ms to minimize.
[2024-05-27 23:43:25] [INFO ] Deduced a trap composed of 265 places in 456 ms of which 4 ms to minimize.
[2024-05-27 23:43:25] [INFO ] Deduced a trap composed of 251 places in 423 ms of which 4 ms to minimize.
[2024-05-27 23:43:26] [INFO ] Deduced a trap composed of 254 places in 440 ms of which 3 ms to minimize.
[2024-05-27 23:43:29] [INFO ] Deduced a trap composed of 69 places in 287 ms of which 2 ms to minimize.
[2024-05-27 23:43:33] [INFO ] Deduced a trap composed of 291 places in 411 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/2580 variables, and 59 constraints, problems are : Problem set: 0 solved, 2040 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/576 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2040 constraints, Known Traps: 19/19 constraints]
After SMT, in 55185ms problems are : Problem set: 0 solved, 2040 unsolved
Search for dead transitions found 0 dead transitions in 55207ms
[2024-05-27 23:43:39] [INFO ] Flow matrix only has 2004 transitions (discarded 40 similar events)
[2024-05-27 23:43:39] [INFO ] Invariant cache hit.
[2024-05-27 23:43:40] [INFO ] Implicit Places using invariants in 558 ms returned []
[2024-05-27 23:43:40] [INFO ] Flow matrix only has 2004 transitions (discarded 40 similar events)
[2024-05-27 23:43:40] [INFO ] Invariant cache hit.
[2024-05-27 23:43:41] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-27 23:43:54] [INFO ] Implicit Places using invariants and state equation in 14482 ms returned []
Implicit Place search using SMT with State Equation took 15047 ms to find 0 implicit places.
[2024-05-27 23:43:54] [INFO ] Redundant transitions in 35 ms returned []
Running 2040 sub problems to find dead transitions.
[2024-05-27 23:43:54] [INFO ] Flow matrix only has 2004 transitions (discarded 40 similar events)
[2024-05-27 23:43:54] [INFO ] Invariant cache hit.
[2024-05-27 23:43:54] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/572 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2040 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/572 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 2040 unsolved
[2024-05-27 23:44:27] [INFO ] Deduced a trap composed of 48 places in 241 ms of which 2 ms to minimize.
[2024-05-27 23:44:27] [INFO ] Deduced a trap composed of 39 places in 283 ms of which 2 ms to minimize.
[2024-05-27 23:44:27] [INFO ] Deduced a trap composed of 48 places in 53 ms of which 1 ms to minimize.
[2024-05-27 23:44:27] [INFO ] Deduced a trap composed of 48 places in 64 ms of which 1 ms to minimize.
[2024-05-27 23:44:27] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 1 ms to minimize.
[2024-05-27 23:44:27] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 1 ms to minimize.
[2024-05-27 23:44:28] [INFO ] Deduced a trap composed of 48 places in 63 ms of which 1 ms to minimize.
[2024-05-27 23:44:28] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 1 ms to minimize.
[2024-05-27 23:44:28] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 1 ms to minimize.
[2024-05-27 23:44:28] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 1 ms to minimize.
[2024-05-27 23:44:28] [INFO ] Deduced a trap composed of 243 places in 499 ms of which 6 ms to minimize.
[2024-05-27 23:44:29] [INFO ] Deduced a trap composed of 245 places in 534 ms of which 5 ms to minimize.
[2024-05-27 23:44:30] [INFO ] Deduced a trap composed of 277 places in 455 ms of which 4 ms to minimize.
[2024-05-27 23:44:30] [INFO ] Deduced a trap composed of 272 places in 433 ms of which 3 ms to minimize.
[2024-05-27 23:44:31] [INFO ] Deduced a trap composed of 260 places in 430 ms of which 3 ms to minimize.
[2024-05-27 23:44:31] [INFO ] Deduced a trap composed of 290 places in 470 ms of which 4 ms to minimize.
[2024-05-27 23:44:32] [INFO ] Deduced a trap composed of 233 places in 429 ms of which 4 ms to minimize.
[2024-05-27 23:44:32] [INFO ] Deduced a trap composed of 68 places in 441 ms of which 4 ms to minimize.
[2024-05-27 23:44:33] [INFO ] Deduced a trap composed of 249 places in 440 ms of which 3 ms to minimize.
[2024-05-27 23:44:33] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/572 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 2040 unsolved
[2024-05-27 23:44:38] [INFO ] Deduced a trap composed of 310 places in 432 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 572/2580 variables, and 61 constraints, problems are : Problem set: 0 solved, 2040 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/576 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2040/2040 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2040 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/572 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2040 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/572 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 2040 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/572 variables, 21/61 constraints. Problems are: Problem set: 0 solved, 2040 unsolved
[2024-05-27 23:45:08] [INFO ] Deduced a trap composed of 220 places in 409 ms of which 4 ms to minimize.
[2024-05-27 23:45:08] [INFO ] Deduced a trap composed of 247 places in 443 ms of which 4 ms to minimize.
[2024-05-27 23:45:09] [INFO ] Deduced a trap composed of 253 places in 357 ms of which 3 ms to minimize.
SMT process timed out in 74710ms, After SMT, problems are : Problem set: 0 solved, 2040 unsolved
Search for dead transitions found 0 dead transitions in 74736ms
Starting structural reductions in SI_LTL mode, iteration 1 : 576/596 places, 2044/2064 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 145099 ms. Remains : 576/596 places, 2044/2064 transitions.
Treatment of property PolyORBLF-COL-S04J04T10-LTLFireability-07 finished in 448036 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)||F((G(F(p1))||(X(F(p1))&&p2))))))'
Support contains 26 out of 856 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 856/856 places, 2324/2324 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 846 transition count 2314
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 846 transition count 2314
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 836 transition count 2304
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 836 transition count 2304
Applied a total of 40 rules in 38 ms. Remains 836 /856 variables (removed 20) and now considering 2304/2324 (removed 20) transitions.
Running 2300 sub problems to find dead transitions.
[2024-05-27 23:45:09] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
// Phase 1: matrix 2264 rows 836 cols
[2024-05-27 23:45:09] [INFO ] Computed 44 invariants in 38 ms
[2024-05-27 23:45:09] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
SMT process timed out in 35461ms, After SMT, problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 35485ms
[2024-05-27 23:45:44] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-05-27 23:45:45] [INFO ] Invariant cache hit.
[2024-05-27 23:45:45] [INFO ] Implicit Places using invariants in 594 ms returned []
[2024-05-27 23:45:45] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-05-27 23:45:45] [INFO ] Invariant cache hit.
[2024-05-27 23:45:47] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-27 23:46:10] [INFO ] Implicit Places using invariants and state equation in 24665 ms returned []
Implicit Place search using SMT with State Equation took 25267 ms to find 0 implicit places.
Running 2300 sub problems to find dead transitions.
[2024-05-27 23:46:10] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-05-27 23:46:10] [INFO ] Invariant cache hit.
[2024-05-27 23:46:10] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/832 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
[2024-05-27 23:46:51] [INFO ] Deduced a trap composed of 74 places in 122 ms of which 2 ms to minimize.
[2024-05-27 23:46:51] [INFO ] Deduced a trap composed of 74 places in 153 ms of which 1 ms to minimize.
[2024-05-27 23:46:51] [INFO ] Deduced a trap composed of 74 places in 58 ms of which 1 ms to minimize.
[2024-05-27 23:46:51] [INFO ] Deduced a trap composed of 74 places in 78 ms of which 1 ms to minimize.
[2024-05-27 23:46:51] [INFO ] Deduced a trap composed of 74 places in 65 ms of which 1 ms to minimize.
[2024-05-27 23:46:51] [INFO ] Deduced a trap composed of 74 places in 84 ms of which 1 ms to minimize.
[2024-05-27 23:46:51] [INFO ] Deduced a trap composed of 74 places in 93 ms of which 2 ms to minimize.
[2024-05-27 23:46:52] [INFO ] Deduced a trap composed of 74 places in 82 ms of which 1 ms to minimize.
[2024-05-27 23:46:52] [INFO ] Deduced a trap composed of 74 places in 68 ms of which 1 ms to minimize.
[2024-05-27 23:46:53] [INFO ] Deduced a trap composed of 489 places in 539 ms of which 6 ms to minimize.
[2024-05-27 23:46:54] [INFO ] Deduced a trap composed of 511 places in 499 ms of which 5 ms to minimize.
[2024-05-27 23:46:54] [INFO ] Deduced a trap composed of 223 places in 507 ms of which 5 ms to minimize.
[2024-05-27 23:46:55] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 832/3100 variables, and 44 constraints, problems are : Problem set: 0 solved, 2300 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 9/11 constraints, Generalized P Invariants (flows): 22/33 constraints, State Equation: 0/836 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2300/2300 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/832 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/832 variables, 13/44 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
[2024-05-27 23:47:01] [INFO ] Deduced a trap composed of 411 places in 504 ms of which 5 ms to minimize.
[2024-05-27 23:47:05] [INFO ] Deduced a trap composed of 579 places in 636 ms of which 6 ms to minimize.
[2024-05-27 23:47:05] [INFO ] Deduced a trap composed of 510 places in 534 ms of which 4 ms to minimize.
[2024-05-27 23:47:06] [INFO ] Deduced a trap composed of 498 places in 523 ms of which 5 ms to minimize.
[2024-05-27 23:47:06] [INFO ] Deduced a trap composed of 507 places in 556 ms of which 5 ms to minimize.
[2024-05-27 23:47:11] [INFO ] Deduced a trap composed of 455 places in 614 ms of which 5 ms to minimize.
[2024-05-27 23:47:11] [INFO ] Deduced a trap composed of 480 places in 530 ms of which 4 ms to minimize.
[2024-05-27 23:47:12] [INFO ] Deduced a trap composed of 492 places in 529 ms of which 4 ms to minimize.
[2024-05-27 23:47:18] [INFO ] Deduced a trap composed of 79 places in 444 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 832/3100 variables, and 53 constraints, problems are : Problem set: 0 solved, 2300 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 9/11 constraints, Generalized P Invariants (flows): 22/33 constraints, State Equation: 0/836 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2300 constraints, Known Traps: 22/22 constraints]
After SMT, in 75219ms problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 75246ms
Starting structural reductions in LTL mode, iteration 1 : 836/856 places, 2304/2324 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 136048 ms. Remains : 836/856 places, 2304/2324 transitions.
Stuttering acceptance computed with spot in 361 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : PolyORBLF-COL-S04J04T10-LTLFireability-09
Product exploration explored 100000 steps with 33333 reset in 866 ms.
Product exploration explored 100000 steps with 33333 reset in 889 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 23 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S04J04T10-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S04J04T10-LTLFireability-09 finished in 138241 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p1))&&p0)))'
Support contains 20 out of 856 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 856/856 places, 2324/2324 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 846 transition count 2314
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 846 transition count 2314
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 836 transition count 2304
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 836 transition count 2304
Applied a total of 40 rules in 55 ms. Remains 836 /856 variables (removed 20) and now considering 2304/2324 (removed 20) transitions.
Running 2300 sub problems to find dead transitions.
[2024-05-27 23:47:27] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-05-27 23:47:27] [INFO ] Invariant cache hit.
[2024-05-27 23:47:27] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 1.0)
(s17 0.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.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 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 timeout
1.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
SMT process timed out in 35157ms, After SMT, problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 35188ms
[2024-05-27 23:48:02] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-05-27 23:48:02] [INFO ] Invariant cache hit.
[2024-05-27 23:48:03] [INFO ] Implicit Places using invariants in 809 ms returned []
[2024-05-27 23:48:03] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-05-27 23:48:03] [INFO ] Invariant cache hit.
[2024-05-27 23:48:05] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-27 23:48:26] [INFO ] Implicit Places using invariants and state equation in 23145 ms returned []
Implicit Place search using SMT with State Equation took 23956 ms to find 0 implicit places.
Running 2300 sub problems to find dead transitions.
[2024-05-27 23:48:26] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-05-27 23:48:26] [INFO ] Invariant cache hit.
[2024-05-27 23:48:26] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/832 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
[2024-05-27 23:49:07] [INFO ] Deduced a trap composed of 74 places in 76 ms of which 1 ms to minimize.
[2024-05-27 23:49:07] [INFO ] Deduced a trap composed of 74 places in 51 ms of which 1 ms to minimize.
[2024-05-27 23:49:08] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 0 ms to minimize.
[2024-05-27 23:49:08] [INFO ] Deduced a trap composed of 74 places in 66 ms of which 1 ms to minimize.
[2024-05-27 23:49:08] [INFO ] Deduced a trap composed of 74 places in 81 ms of which 1 ms to minimize.
[2024-05-27 23:49:08] [INFO ] Deduced a trap composed of 74 places in 78 ms of which 2 ms to minimize.
[2024-05-27 23:49:08] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 1 ms to minimize.
[2024-05-27 23:49:08] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 1 ms to minimize.
[2024-05-27 23:49:08] [INFO ] Deduced a trap composed of 74 places in 65 ms of which 1 ms to minimize.
[2024-05-27 23:49:09] [INFO ] Deduced a trap composed of 489 places in 424 ms of which 5 ms to minimize.
[2024-05-27 23:49:10] [INFO ] Deduced a trap composed of 511 places in 496 ms of which 4 ms to minimize.
[2024-05-27 23:49:11] [INFO ] Deduced a trap composed of 223 places in 663 ms of which 4 ms to minimize.
[2024-05-27 23:49:11] [INFO ] Deduced a trap composed of 74 places in 83 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 832/3100 variables, and 44 constraints, problems are : Problem set: 0 solved, 2300 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 9/11 constraints, Generalized P Invariants (flows): 22/33 constraints, State Equation: 0/836 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2300/2300 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/832 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/832 variables, 13/44 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
[2024-05-27 23:49:18] [INFO ] Deduced a trap composed of 411 places in 571 ms of which 6 ms to minimize.
[2024-05-27 23:49:22] [INFO ] Deduced a trap composed of 579 places in 531 ms of which 5 ms to minimize.
[2024-05-27 23:49:22] [INFO ] Deduced a trap composed of 510 places in 465 ms of which 5 ms to minimize.
[2024-05-27 23:49:23] [INFO ] Deduced a trap composed of 498 places in 513 ms of which 5 ms to minimize.
[2024-05-27 23:49:23] [INFO ] Deduced a trap composed of 507 places in 541 ms of which 5 ms to minimize.
[2024-05-27 23:49:27] [INFO ] Deduced a trap composed of 455 places in 554 ms of which 6 ms to minimize.
[2024-05-27 23:49:27] [INFO ] Deduced a trap composed of 480 places in 514 ms of which 6 ms to minimize.
[2024-05-27 23:49:28] [INFO ] Deduced a trap composed of 492 places in 482 ms of which 5 ms to minimize.
[2024-05-27 23:49:32] [INFO ] Deduced a trap composed of 79 places in 321 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 832/3100 variables, and 53 constraints, problems are : Problem set: 0 solved, 2300 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 9/11 constraints, Generalized P Invariants (flows): 22/33 constraints, State Equation: 0/836 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2300 constraints, Known Traps: 22/22 constraints]
After SMT, in 75536ms problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 75562ms
Starting structural reductions in LTL mode, iteration 1 : 836/856 places, 2304/2324 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 134773 ms. Remains : 836/856 places, 2304/2324 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : PolyORBLF-COL-S04J04T10-LTLFireability-11
Stuttering criterion allowed to conclude after 78750 steps with 0 reset in 408 ms.
FORMULA PolyORBLF-COL-S04J04T10-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S04J04T10-LTLFireability-11 finished in 135330 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 11 out of 856 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 856/856 places, 2324/2324 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 856 transition count 2234
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 180 place count 766 transition count 2234
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 180 place count 766 transition count 2134
Deduced a syphon composed of 100 places in 2 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 380 place count 666 transition count 2134
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 390 place count 656 transition count 2124
Iterating global reduction 2 with 10 rules applied. Total rules applied 400 place count 656 transition count 2124
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 2 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 600 place count 556 transition count 2024
Applied a total of 600 rules in 103 ms. Remains 556 /856 variables (removed 300) and now considering 2024/2324 (removed 300) transitions.
Running 2020 sub problems to find dead transitions.
[2024-05-27 23:49:43] [INFO ] Flow matrix only has 1984 transitions (discarded 40 similar events)
// Phase 1: matrix 1984 rows 556 cols
[2024-05-27 23:49:43] [INFO ] Computed 44 invariants in 29 ms
[2024-05-27 23:49:43] [INFO ] State equation strengthened by 200 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-COL-S04J04T10

IS_COLORED=1
IS_NUPN=

LOADING model.pnml ...
MODEL CLASS: SYMMETRIC NET
PLACES: 81
TRANSITIONS: 65
CONSTANTS: 0
TEMPLATE VARS: 0
COLOR CLASSES: 6
COLOR VARS: 25
ARCS: 254
LOADING TIME: 0.34

UNFOLDING COLORS...
MODEL CLASS: P/T NET
PLACES: 870
TRANSITIONS: 5034
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 34774
UNFOLDING TIME: 0.854

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.168
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING UNFOLDING MAP FILE /home/mcc/execution/model.unfmap ...
TOTAL TIME: 1.59
OK.
----------------------------------------------------------------------
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: 2842
MODEL NAME: /home/mcc/execution/model
870 places, 5034 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
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-S04J04T10"
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-S04J04T10, 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-171654445300140"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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