Execution Chart

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

Trace from the execution

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

--------------------
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 1717250144110

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S04J04T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:55:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 13:55:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:55:45] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 13:55:45] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 13:55:46] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 559 ms
[2024-06-01 13:55:46] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 870 PT places and 5136.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 13:55:46] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2024-06-01 13:55:46] [INFO ] Skeletonized 16 HLPN properties in 1 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 10894 steps (3 resets) in 280 ms. (38 steps per ms) remains 0/21 properties
[2024-06-01 13:55:46] [INFO ] Flatten gal took : 24 ms
[2024-06-01 13:55:46] [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-06-01 13:55:46] [INFO ] Unfolded HLPN to a Petri net with 870 places and 5034 transitions 34774 arcs in 98 ms.
[2024-06-01 13:55:46] [INFO ] Unfolded 10 HLPN properties in 0 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 72 ms. Remains 866 /870 variables (removed 4) and now considering 2324/2324 (removed 0) transitions.
Running 2320 sub problems to find dead transitions.
[2024-06-01 13:55:46] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
// Phase 1: matrix 2284 rows 866 cols
[2024-06-01 13:55:47] [INFO ] Computed 54 invariants in 122 ms
[2024-06-01 13:55:47] [INFO ] State equation strengthened by 200 read => feed constraints.
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 32413ms, After SMT, problems are : Problem set: 0 solved, 2320 unsolved
Search for dead transitions found 0 dead transitions in 32463ms
[2024-06-01 13:56:19] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
[2024-06-01 13:56:19] [INFO ] Invariant cache hit.
[2024-06-01 13:56:19] [INFO ] Implicit Places using invariants in 360 ms returned [668, 669, 670, 671, 672, 673, 674, 675, 676, 677]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 375 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 32979 ms. Remains : 856/870 places, 2324/2324 transitions.
Support contains 383 out of 856 places after structural reductions.
[2024-06-01 13:56:20] [INFO ] Flatten gal took : 202 ms
[2024-06-01 13:56:20] [INFO ] Flatten gal took : 167 ms
[2024-06-01 13:56:20] [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 7736 steps (2 resets) in 463 ms. (16 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 314 ms. Remains 596 /856 variables (removed 260) and now considering 2064/2324 (removed 260) transitions.
Running 2060 sub problems to find dead transitions.
[2024-06-01 13:56:21] [INFO ] Flow matrix only has 2024 transitions (discarded 40 similar events)
// Phase 1: matrix 2024 rows 596 cols
[2024-06-01 13:56:21] [INFO ] Computed 44 invariants in 44 ms
[2024-06-01 13:56:21] [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-06-01 13:56:50] [INFO ] Deduced a trap composed of 50 places in 120 ms of which 11 ms to minimize.
[2024-06-01 13:56:50] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 1 ms to minimize.
[2024-06-01 13:56:50] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 2 ms to minimize.
[2024-06-01 13:56:50] [INFO ] Deduced a trap composed of 50 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:56:50] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:56:50] [INFO ] Deduced a trap composed of 50 places in 45 ms of which 0 ms to minimize.
[2024-06-01 13:56:50] [INFO ] Deduced a trap composed of 50 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:56:50] [INFO ] Deduced a trap composed of 50 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:56:50] [INFO ] Deduced a trap composed of 50 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:56:52] [INFO ] Deduced a trap composed of 305 places in 424 ms of which 5 ms to minimize.
[2024-06-01 13:56:52] [INFO ] Deduced a trap composed of 294 places in 451 ms of which 4 ms to minimize.
[2024-06-01 13:56:52] [INFO ] Deduced a trap composed of 281 places in 369 ms of which 3 ms to minimize.
[2024-06-01 13:56:54] [INFO ] Deduced a trap composed of 50 places in 43 ms of which 1 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 20057 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-06-01 13:57:00] [INFO ] Deduced a trap composed of 23 places in 196 ms of which 3 ms to minimize.
[2024-06-01 13:57:06] [INFO ] Deduced a trap composed of 290 places in 335 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 592/2620 variables, and 55 constraints, problems are : Problem set: 0 solved, 2060 unsolved in 20036 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: 15/15 constraints]
After SMT, in 53715ms problems are : Problem set: 0 solved, 2060 unsolved
Search for dead transitions found 0 dead transitions in 53743ms
[2024-06-01 13:57:15] [INFO ] Flow matrix only has 2024 transitions (discarded 40 similar events)
[2024-06-01 13:57:15] [INFO ] Invariant cache hit.
[2024-06-01 13:57:15] [INFO ] Implicit Places using invariants in 532 ms returned []
[2024-06-01 13:57:15] [INFO ] Flow matrix only has 2024 transitions (discarded 40 similar events)
[2024-06-01 13:57:15] [INFO ] Invariant cache hit.
[2024-06-01 13:57:16] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 13:57:25] [INFO ] Implicit Places using invariants and state equation in 9756 ms returned []
Implicit Place search using SMT with State Equation took 10290 ms to find 0 implicit places.
[2024-06-01 13:57:25] [INFO ] Redundant transitions in 96 ms returned []
Running 2060 sub problems to find dead transitions.
[2024-06-01 13:57:25] [INFO ] Flow matrix only has 2024 transitions (discarded 40 similar events)
[2024-06-01 13:57:25] [INFO ] Invariant cache hit.
[2024-06-01 13:57:25] [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-06-01 13:57:55] [INFO ] Deduced a trap composed of 50 places in 162 ms of which 4 ms to minimize.
[2024-06-01 13:57:55] [INFO ] Deduced a trap composed of 50 places in 130 ms of which 2 ms to minimize.
[2024-06-01 13:57:55] [INFO ] Deduced a trap composed of 50 places in 72 ms of which 1 ms to minimize.
[2024-06-01 13:57:55] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:57:55] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:57:55] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:57:55] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 1 ms to minimize.
[2024-06-01 13:57:56] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:57:56] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 2 ms to minimize.
[2024-06-01 13:57:57] [INFO ] Deduced a trap composed of 280 places in 472 ms of which 3 ms to minimize.
[2024-06-01 13:57:58] [INFO ] Deduced a trap composed of 300 places in 467 ms of which 4 ms to minimize.
[2024-06-01 13:58:01] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:58:03] [INFO ] Deduced a trap composed of 290 places in 422 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 30049 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-06-01 13:58:22] [INFO ] Deduced a trap composed of 23 places in 179 ms of which 3 ms to minimize.
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 30044 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 73716ms problems are : Problem set: 0 solved, 2060 unsolved
Search for dead transitions found 0 dead transitions in 73740ms
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 138209 ms. Remains : 596/856 places, 2064/2324 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J04T10-LTLFireability-00
Product exploration explored 100000 steps with 7 reset in 1031 ms.
Stack based approach found an accepted trace after 5307 steps with 0 reset with depth 5308 and stack size 5308 in 95 ms.
FORMULA PolyORBLF-COL-S04J04T10-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-COL-S04J04T10-LTLFireability-00 finished in 139599 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 71 ms. Remains 836 /856 variables (removed 20) and now considering 2304/2324 (removed 20) transitions.
Running 2300 sub problems to find dead transitions.
[2024-06-01 13:58:40] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
// Phase 1: matrix 2264 rows 836 cols
[2024-06-01 13:58:40] [INFO ] Computed 44 invariants in 43 ms
[2024-06-01 13:58:40] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
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 34541ms, After SMT, problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 34579ms
[2024-06-01 13:59:15] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-06-01 13:59:15] [INFO ] Invariant cache hit.
[2024-06-01 13:59:15] [INFO ] Implicit Places using invariants in 512 ms returned []
[2024-06-01 13:59:15] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-06-01 13:59:15] [INFO ] Invariant cache hit.
[2024-06-01 13:59:17] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 13:59:38] [INFO ] Implicit Places using invariants and state equation in 22782 ms returned []
Implicit Place search using SMT with State Equation took 23296 ms to find 0 implicit places.
Running 2300 sub problems to find dead transitions.
[2024-06-01 13:59:38] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-06-01 13:59:38] [INFO ] Invariant cache hit.
[2024-06-01 13:59:38] [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-06-01 14:00:18] [INFO ] Deduced a trap composed of 74 places in 73 ms of which 1 ms to minimize.
[2024-06-01 14:00:18] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 1 ms to minimize.
[2024-06-01 14:00:18] [INFO ] Deduced a trap composed of 74 places in 60 ms of which 1 ms to minimize.
[2024-06-01 14:00:18] [INFO ] Deduced a trap composed of 74 places in 70 ms of which 1 ms to minimize.
[2024-06-01 14:00:18] [INFO ] Deduced a trap composed of 74 places in 81 ms of which 1 ms to minimize.
[2024-06-01 14:00:18] [INFO ] Deduced a trap composed of 74 places in 99 ms of which 1 ms to minimize.
[2024-06-01 14:00:18] [INFO ] Deduced a trap composed of 74 places in 76 ms of which 1 ms to minimize.
[2024-06-01 14:00:18] [INFO ] Deduced a trap composed of 74 places in 92 ms of which 2 ms to minimize.
[2024-06-01 14:00:19] [INFO ] Deduced a trap composed of 74 places in 78 ms of which 1 ms to minimize.
[2024-06-01 14:00:20] [INFO ] Deduced a trap composed of 489 places in 567 ms of which 6 ms to minimize.
[2024-06-01 14:00:21] [INFO ] Deduced a trap composed of 511 places in 566 ms of which 7 ms to minimize.
[2024-06-01 14:00:21] [INFO ] Deduced a trap composed of 223 places in 576 ms of which 6 ms to minimize.
[2024-06-01 14:00:22] [INFO ] Deduced a trap composed of 74 places in 78 ms of which 2 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 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: 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-06-01 14:00:29] [INFO ] Deduced a trap composed of 411 places in 451 ms of which 5 ms to minimize.
[2024-06-01 14:00:32] [INFO ] Deduced a trap composed of 579 places in 639 ms of which 7 ms to minimize.
[2024-06-01 14:00:33] [INFO ] Deduced a trap composed of 510 places in 631 ms of which 6 ms to minimize.
[2024-06-01 14:00:33] [INFO ] Deduced a trap composed of 498 places in 479 ms of which 7 ms to minimize.
[2024-06-01 14:00:34] [INFO ] Deduced a trap composed of 507 places in 614 ms of which 6 ms to minimize.
[2024-06-01 14:00:38] [INFO ] Deduced a trap composed of 455 places in 494 ms of which 4 ms to minimize.
[2024-06-01 14:00:39] [INFO ] Deduced a trap composed of 480 places in 645 ms of which 5 ms to minimize.
[2024-06-01 14:00:39] [INFO ] Deduced a trap composed of 492 places in 562 ms of which 6 ms to minimize.
[2024-06-01 14:00:43] [INFO ] Deduced a trap composed of 79 places in 319 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 30030 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 74812ms problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 74846ms
Starting structural reductions in LTL mode, iteration 1 : 836/856 places, 2304/2324 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 132812 ms. Remains : 836/856 places, 2304/2324 transitions.
Stuttering acceptance computed with spot in 142 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 1146 reset in 1253 ms.
Product exploration explored 100000 steps with 1204 reset in 988 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 170 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 198 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 496 ms. (80 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40001 steps (8 resets) in 799 ms. (50 steps per ms) remains 1/1 properties
[2024-06-01 14:00:56] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-06-01 14:00:56] [INFO ] Invariant cache hit.
[2024-06-01 14:00:56] [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 504 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 666ms 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 353 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 156 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
Stuttering acceptance computed with spot in 165 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 24 ms. Remains 836 /836 variables (removed 0) and now considering 2304/2304 (removed 0) transitions.
Running 2300 sub problems to find dead transitions.
[2024-06-01 14:00:58] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-06-01 14:00:58] [INFO ] Invariant cache hit.
[2024-06-01 14:00:58] [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 32794ms, After SMT, problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 32822ms
[2024-06-01 14:01:30] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-06-01 14:01:30] [INFO ] Invariant cache hit.
[2024-06-01 14:01:31] [INFO ] Implicit Places using invariants in 531 ms returned []
[2024-06-01 14:01:31] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-06-01 14:01:31] [INFO ] Invariant cache hit.
[2024-06-01 14:01:32] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 14:01:53] [INFO ] Implicit Places using invariants and state equation in 21516 ms returned []
Implicit Place search using SMT with State Equation took 22050 ms to find 0 implicit places.
Running 2300 sub problems to find dead transitions.
[2024-06-01 14:01:53] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-06-01 14:01:53] [INFO ] Invariant cache hit.
[2024-06-01 14:01: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-06-01 14:02:29] [INFO ] Deduced a trap composed of 74 places in 100 ms of which 3 ms to minimize.
[2024-06-01 14:02:29] [INFO ] Deduced a trap composed of 74 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:02:29] [INFO ] Deduced a trap composed of 74 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:02:29] [INFO ] Deduced a trap composed of 74 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:02:29] [INFO ] Deduced a trap composed of 74 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:02:29] [INFO ] Deduced a trap composed of 74 places in 68 ms of which 3 ms to minimize.
[2024-06-01 14:02:30] [INFO ] Deduced a trap composed of 74 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:02:30] [INFO ] Deduced a trap composed of 74 places in 49 ms of which 0 ms to minimize.
[2024-06-01 14:02:30] [INFO ] Deduced a trap composed of 74 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:02:31] [INFO ] Deduced a trap composed of 489 places in 454 ms of which 4 ms to minimize.
[2024-06-01 14:02:31] [INFO ] Deduced a trap composed of 511 places in 493 ms of which 5 ms to minimize.
[2024-06-01 14:02:32] [INFO ] Deduced a trap composed of 223 places in 417 ms of which 4 ms to minimize.
[2024-06-01 14:02:32] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 2 ms to minimize.
[2024-06-01 14:02:35] [INFO ] Deduced a trap composed of 99 places in 300 ms of which 3 ms to minimize.
[2024-06-01 14:02:37] [INFO ] Deduced a trap composed of 516 places in 545 ms of which 6 ms to minimize.
SMT process timed out in 44006ms, After SMT, problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 44026ms
Finished structural reductions in LTL mode , in 1 iterations and 98934 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 143 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 143 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
RANDOM walk for 902 steps (0 resets) in 25 ms. (34 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 287 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 136 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
Product exploration explored 100000 steps with 1246 reset in 744 ms.
Product exploration explored 100000 steps with 1178 reset in 932 ms.
Applying partial POR strategy [false, true, false, false]
Stuttering acceptance computed with spot in 143 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 1 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 2 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 2 ms
Applied a total of 350 rules in 235 ms. Remains 776 /836 variables (removed 60) and now considering 2244/2304 (removed 60) transitions.
Running 2240 sub problems to find dead transitions.
[2024-06-01 14:02:40] [INFO ] Flow matrix only has 2204 transitions (discarded 40 similar events)
// Phase 1: matrix 2204 rows 776 cols
[2024-06-01 14:02:40] [INFO ] Computed 44 invariants in 46 ms
[2024-06-01 14:02:40] [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 32999ms, After SMT, problems are : Problem set: 0 solved, 2240 unsolved
Search for dead transitions found 0 dead transitions in 33027ms
[2024-06-01 14:03:13] [INFO ] Redundant transitions in 139 ms returned []
Running 2240 sub problems to find dead transitions.
[2024-06-01 14:03:13] [INFO ] Flow matrix only has 2204 transitions (discarded 40 similar events)
[2024-06-01 14:03:13] [INFO ] Invariant cache hit.
[2024-06-01 14:03:13] [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-06-01 14:03:49] [INFO ] Deduced a trap composed of 50 places in 312 ms of which 5 ms to minimize.
[2024-06-01 14:03:49] [INFO ] Deduced a trap composed of 50 places in 215 ms of which 3 ms to minimize.
[2024-06-01 14:03:49] [INFO ] Deduced a trap composed of 50 places in 178 ms of which 2 ms to minimize.
[2024-06-01 14:03:49] [INFO ] Deduced a trap composed of 50 places in 195 ms of which 4 ms to minimize.
[2024-06-01 14:03:50] [INFO ] Deduced a trap composed of 50 places in 144 ms of which 3 ms to minimize.
[2024-06-01 14:03:50] [INFO ] Deduced a trap composed of 50 places in 186 ms of which 2 ms to minimize.
[2024-06-01 14:03:50] [INFO ] Deduced a trap composed of 50 places in 138 ms of which 2 ms to minimize.
[2024-06-01 14:03:50] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 1 ms to minimize.
[2024-06-01 14:03:50] [INFO ] Deduced a trap composed of 50 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:03:50] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 2 ms to minimize.
[2024-06-01 14:03:52] [INFO ] Deduced a trap composed of 315 places in 603 ms of which 6 ms to minimize.
[2024-06-01 14:03:52] [INFO ] Deduced a trap composed of 295 places in 493 ms of which 6 ms to minimize.
[2024-06-01 14:03:53] [INFO ] Deduced a trap composed of 377 places in 569 ms of which 5 ms to minimize.
[2024-06-01 14:03:54] [INFO ] Deduced a trap composed of 295 places in 563 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 772/2980 variables, and 54 constraints, problems are : Problem set: 0 solved, 2240 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/776 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2240/2240 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2240 unsolved
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
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD1304 is UNSAT
Problem TDEAD1305 is UNSAT
Problem TDEAD1306 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1312 is UNSAT
Problem TDEAD1313 is UNSAT
Problem TDEAD1324 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1326 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1329 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1334 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1339 is UNSAT
Problem TDEAD1340 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1343 is UNSAT
Problem TDEAD1584 is UNSAT
Problem TDEAD1585 is UNSAT
Problem TDEAD1586 is UNSAT
Problem TDEAD1587 is UNSAT
Problem TDEAD1588 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1590 is UNSAT
Problem TDEAD1591 is UNSAT
Problem TDEAD1592 is UNSAT
Problem TDEAD1593 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1595 is UNSAT
Problem TDEAD1596 is UNSAT
Problem TDEAD1597 is UNSAT
Problem TDEAD1598 is UNSAT
Problem TDEAD1599 is UNSAT
Problem TDEAD1600 is UNSAT
Problem TDEAD1601 is UNSAT
Problem TDEAD1602 is UNSAT
Problem TDEAD1603 is UNSAT
Problem TDEAD1604 is UNSAT
Problem TDEAD1605 is UNSAT
Problem TDEAD1606 is UNSAT
Problem TDEAD1607 is UNSAT
Problem TDEAD1608 is UNSAT
Problem TDEAD1609 is UNSAT
Problem TDEAD1610 is UNSAT
Problem TDEAD1611 is UNSAT
Problem TDEAD1612 is UNSAT
Problem TDEAD1613 is UNSAT
Problem TDEAD1614 is UNSAT
Problem TDEAD1615 is UNSAT
Problem TDEAD1616 is UNSAT
Problem TDEAD1617 is UNSAT
Problem TDEAD1618 is UNSAT
Problem TDEAD1619 is UNSAT
Problem TDEAD1620 is UNSAT
Problem TDEAD1621 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1623 is UNSAT
Problem TDEAD1624 is UNSAT
Problem TDEAD1625 is UNSAT
Problem TDEAD1626 is UNSAT
Problem TDEAD1627 is UNSAT
Problem TDEAD1628 is UNSAT
Problem TDEAD1629 is UNSAT
Problem TDEAD1630 is UNSAT
Problem TDEAD1631 is UNSAT
Problem TDEAD1632 is UNSAT
Problem TDEAD1633 is UNSAT
Problem TDEAD1694 is UNSAT
Problem TDEAD1695 is UNSAT
Problem TDEAD1696 is UNSAT
Problem TDEAD1697 is UNSAT
Problem TDEAD1698 is UNSAT
Problem TDEAD1699 is UNSAT
Problem TDEAD1700 is UNSAT
Problem TDEAD1701 is UNSAT
Problem TDEAD1702 is UNSAT
Problem TDEAD1703 is UNSAT
Problem TDEAD1704 is UNSAT
Problem TDEAD1705 is UNSAT
Problem TDEAD1706 is UNSAT
Problem TDEAD1707 is UNSAT
Problem TDEAD1708 is UNSAT
Problem TDEAD1709 is UNSAT
Problem TDEAD1710 is UNSAT
Problem TDEAD1711 is UNSAT
Problem TDEAD1712 is UNSAT
Problem TDEAD1713 is UNSAT
Problem TDEAD2154 is UNSAT
Problem TDEAD2159 is UNSAT
Problem TDEAD2164 is UNSAT
Problem TDEAD2169 is UNSAT
Problem TDEAD2174 is UNSAT
Problem TDEAD2179 is UNSAT
Problem TDEAD2184 is UNSAT
Problem TDEAD2189 is UNSAT
Problem TDEAD2194 is UNSAT
Problem TDEAD2199 is UNSAT
Problem TDEAD2205 is UNSAT
Problem TDEAD2207 is UNSAT
Problem TDEAD2209 is UNSAT
Problem TDEAD2211 is UNSAT
Problem TDEAD2213 is UNSAT
Problem TDEAD2215 is UNSAT
Problem TDEAD2217 is UNSAT
Problem TDEAD2219 is UNSAT
Problem TDEAD2221 is UNSAT
Problem TDEAD2223 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/772 variables, 14/54 constraints. Problems are: Problem set: 160 solved, 2080 unsolved
[2024-06-01 14:04:03] [INFO ] Deduced a trap composed of 324 places in 601 ms of which 5 ms to minimize.
[2024-06-01 14:04:03] [INFO ] Deduced a trap composed of 23 places in 550 ms of which 5 ms to minimize.
[2024-06-01 14:04:04] [INFO ] Deduced a trap composed of 293 places in 558 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 772/2980 variables, and 57 constraints, problems are : Problem set: 160 solved, 2080 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/776 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2240 constraints, Known Traps: 17/17 constraints]
After SMT, in 73433ms problems are : Problem set: 160 solved, 2080 unsolved
Search for dead transitions found 160 dead transitions in 73460ms
Found 160 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 160 transitions
Dead transitions reduction (with SMT) removed 160 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 776/836 places, 2084/2304 transitions.
Graph (complete) has 4220 edges and 776 vertex of which 616 are kept as prefixes of interest. Removing 160 places using SCC suffix rule.9 ms
Discarding 160 places :
Also discarding 0 output transitions
Deduced a syphon composed of 20 places in 2 ms
Applied a total of 1 rules in 89 ms. Remains 616 /776 variables (removed 160) and now considering 2084/2084 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 616/836 places, 2084/2304 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 106984 ms. Remains : 616/836 places, 2084/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 24 ms. Remains 836 /836 variables (removed 0) and now considering 2304/2304 (removed 0) transitions.
Running 2300 sub problems to find dead transitions.
[2024-06-01 14:04:27] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
// Phase 1: matrix 2264 rows 836 cols
[2024-06-01 14:04:27] [INFO ] Computed 44 invariants in 78 ms
[2024-06-01 14:04:27] [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 32496ms, After SMT, problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 32526ms
[2024-06-01 14:04:59] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-06-01 14:04:59] [INFO ] Invariant cache hit.
[2024-06-01 14:05:00] [INFO ] Implicit Places using invariants in 491 ms returned []
[2024-06-01 14:05:00] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-06-01 14:05:00] [INFO ] Invariant cache hit.
[2024-06-01 14:05:01] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 14:05:21] [INFO ] Implicit Places using invariants and state equation in 21003 ms returned []
Implicit Place search using SMT with State Equation took 21495 ms to find 0 implicit places.
Running 2300 sub problems to find dead transitions.
[2024-06-01 14:05:21] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-06-01 14:05:21] [INFO ] Invariant cache hit.
[2024-06-01 14:05:21] [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-06-01 14:05:59] [INFO ] Deduced a trap composed of 74 places in 115 ms of which 2 ms to minimize.
[2024-06-01 14:05:59] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 1 ms to minimize.
[2024-06-01 14:05:59] [INFO ] Deduced a trap composed of 74 places in 55 ms of which 0 ms to minimize.
[2024-06-01 14:06:00] [INFO ] Deduced a trap composed of 74 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:06:00] [INFO ] Deduced a trap composed of 74 places in 102 ms of which 1 ms to minimize.
[2024-06-01 14:06:00] [INFO ] Deduced a trap composed of 74 places in 81 ms of which 1 ms to minimize.
[2024-06-01 14:06:00] [INFO ] Deduced a trap composed of 74 places in 60 ms of which 1 ms to minimize.
[2024-06-01 14:06:00] [INFO ] Deduced a trap composed of 74 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:06:00] [INFO ] Deduced a trap composed of 74 places in 52 ms of which 0 ms to minimize.
[2024-06-01 14:06:01] [INFO ] Deduced a trap composed of 489 places in 455 ms of which 5 ms to minimize.
[2024-06-01 14:06:02] [INFO ] Deduced a trap composed of 511 places in 403 ms of which 4 ms to minimize.
[2024-06-01 14:06:02] [INFO ] Deduced a trap composed of 223 places in 548 ms of which 6 ms to minimize.
[2024-06-01 14:06:03] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 2 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-06-01 14:06:10] [INFO ] Deduced a trap composed of 411 places in 500 ms of which 6 ms to minimize.
[2024-06-01 14:06:14] [INFO ] Deduced a trap composed of 579 places in 534 ms of which 6 ms to minimize.
[2024-06-01 14:06:14] [INFO ] Deduced a trap composed of 510 places in 484 ms of which 4 ms to minimize.
[2024-06-01 14:06:15] [INFO ] Deduced a trap composed of 498 places in 485 ms of which 5 ms to minimize.
[2024-06-01 14:06:15] [INFO ] Deduced a trap composed of 507 places in 480 ms of which 4 ms to minimize.
[2024-06-01 14:06:19] [INFO ] Deduced a trap composed of 455 places in 451 ms of which 5 ms to minimize.
[2024-06-01 14:06:20] [INFO ] Deduced a trap composed of 480 places in 495 ms of which 5 ms to minimize.
[2024-06-01 14:06:20] [INFO ] Deduced a trap composed of 492 places in 549 ms of which 5 ms to minimize.
[2024-06-01 14:06:24] [INFO ] Deduced a trap composed of 79 places in 352 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 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: 0/2300 constraints, Known Traps: 22/22 constraints]
After SMT, in 73947ms problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 73967ms
Finished structural reductions in LTL mode , in 1 iterations and 128024 ms. Remains : 836/836 places, 2304/2304 transitions.
Treatment of property PolyORBLF-COL-S04J04T10-LTLFireability-01 finished in 474683 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 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-06-01 14:06:35] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-06-01 14:06:35] [INFO ] Invariant cache hit.
[2024-06-01 14:06:35] [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 32924ms, After SMT, problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 32951ms
[2024-06-01 14:07:08] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-06-01 14:07:08] [INFO ] Invariant cache hit.
[2024-06-01 14:07:08] [INFO ] Implicit Places using invariants in 507 ms returned []
[2024-06-01 14:07:08] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-06-01 14:07:08] [INFO ] Invariant cache hit.
[2024-06-01 14:07:10] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 14:07:28] [INFO ] Implicit Places using invariants and state equation in 19407 ms returned []
Implicit Place search using SMT with State Equation took 19917 ms to find 0 implicit places.
Running 2300 sub problems to find dead transitions.
[2024-06-01 14:07:28] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-06-01 14:07:28] [INFO ] Invariant cache hit.
[2024-06-01 14:07:28] [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-06-01 14:08:05] [INFO ] Deduced a trap composed of 74 places in 113 ms of which 1 ms to minimize.
[2024-06-01 14:08:06] [INFO ] Deduced a trap composed of 74 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:08:06] [INFO ] Deduced a trap composed of 74 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:08:06] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 2 ms to minimize.
[2024-06-01 14:08:06] [INFO ] Deduced a trap composed of 74 places in 70 ms of which 1 ms to minimize.
[2024-06-01 14:08:06] [INFO ] Deduced a trap composed of 74 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:08:06] [INFO ] Deduced a trap composed of 74 places in 78 ms of which 2 ms to minimize.
[2024-06-01 14:08:06] [INFO ] Deduced a trap composed of 74 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:08:06] [INFO ] Deduced a trap composed of 74 places in 74 ms of which 1 ms to minimize.
[2024-06-01 14:08:07] [INFO ] Deduced a trap composed of 489 places in 523 ms of which 6 ms to minimize.
[2024-06-01 14:08:08] [INFO ] Deduced a trap composed of 511 places in 454 ms of which 5 ms to minimize.
[2024-06-01 14:08:09] [INFO ] Deduced a trap composed of 223 places in 468 ms of which 6 ms to minimize.
[2024-06-01 14:08:09] [INFO ] Deduced a trap composed of 74 places in 69 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 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: 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-06-01 14:08:18] [INFO ] Deduced a trap composed of 411 places in 605 ms of which 6 ms to minimize.
[2024-06-01 14:08:22] [INFO ] Deduced a trap composed of 579 places in 569 ms of which 4 ms to minimize.
[2024-06-01 14:08:22] [INFO ] Deduced a trap composed of 510 places in 496 ms of which 5 ms to minimize.
[2024-06-01 14:08:23] [INFO ] Deduced a trap composed of 498 places in 529 ms of which 4 ms to minimize.
[2024-06-01 14:08:23] [INFO ] Deduced a trap composed of 507 places in 468 ms of which 4 ms to minimize.
[2024-06-01 14:08:27] [INFO ] Deduced a trap composed of 455 places in 485 ms of which 5 ms to minimize.
[2024-06-01 14:08:27] [INFO ] Deduced a trap composed of 480 places in 529 ms of which 6 ms to minimize.
[2024-06-01 14:08:28] [INFO ] Deduced a trap composed of 492 places in 401 ms of which 4 ms to minimize.
[2024-06-01 14:08:32] [INFO ] Deduced a trap composed of 79 places in 305 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 30027 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 72891ms problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 72931ms
Starting structural reductions in LTL mode, iteration 1 : 836/856 places, 2304/2324 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 125870 ms. Remains : 836/856 places, 2304/2324 transitions.
Stuttering acceptance computed with spot in 124 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 1228 reset in 580 ms.
Product exploration explored 100000 steps with 1229 reset in 480 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 137 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 86 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 353 steps (0 resets) in 9 ms. (35 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 202 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 87 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
[2024-06-01 14:08:43] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-06-01 14:08:43] [INFO ] Invariant cache hit.
[2024-06-01 14:08:44] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-06-01 14:08:44] [INFO ] [Real]Absence check using 11 positive and 33 generalized place invariants in 102 ms returned sat
[2024-06-01 14:08:47] [INFO ] [Real]Absence check using state equation in 3275 ms returned sat
[2024-06-01 14:08:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:08:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-06-01 14:08:49] [INFO ] [Nat]Absence check using 11 positive and 33 generalized place invariants in 148 ms returned sat
[2024-06-01 14:08:54] [INFO ] [Nat]Absence check using state equation in 5287 ms returned unknown
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 97 ms. Remains 576 /836 variables (removed 260) and now considering 2044/2304 (removed 260) transitions.
Running 2040 sub problems to find dead transitions.
[2024-06-01 14:08:54] [INFO ] Flow matrix only has 2004 transitions (discarded 40 similar events)
// Phase 1: matrix 2004 rows 576 cols
[2024-06-01 14:08:54] [INFO ] Computed 44 invariants in 54 ms
[2024-06-01 14:08: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-06-01 14:09:22] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 1 ms to minimize.
[2024-06-01 14:09:22] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:09:22] [INFO ] Deduced a trap composed of 48 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:09:22] [INFO ] Deduced a trap composed of 48 places in 37 ms of which 1 ms to minimize.
[2024-06-01 14:09:23] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:09:23] [INFO ] Deduced a trap composed of 48 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:09:23] [INFO ] Deduced a trap composed of 48 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:09:23] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 1 ms to minimize.
[2024-06-01 14:09:23] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 0 ms to minimize.
[2024-06-01 14:09:24] [INFO ] Deduced a trap composed of 284 places in 489 ms of which 4 ms to minimize.
[2024-06-01 14:09:24] [INFO ] Deduced a trap composed of 48 places in 496 ms of which 5 ms to minimize.
[2024-06-01 14:09:25] [INFO ] Deduced a trap composed of 298 places in 395 ms of which 4 ms to minimize.
[2024-06-01 14:09:25] [INFO ] Deduced a trap composed of 271 places in 412 ms of which 4 ms to minimize.
[2024-06-01 14:09:26] [INFO ] Deduced a trap composed of 265 places in 552 ms of which 5 ms to minimize.
[2024-06-01 14:09:26] [INFO ] Deduced a trap composed of 246 places in 446 ms of which 3 ms to minimize.
[2024-06-01 14:09:27] [INFO ] Deduced a trap composed of 268 places in 409 ms of which 5 ms to minimize.
SMT process timed out in 32561ms, After SMT, problems are : Problem set: 0 solved, 2040 unsolved
Search for dead transitions found 0 dead transitions in 32581ms
[2024-06-01 14:09:27] [INFO ] Flow matrix only has 2004 transitions (discarded 40 similar events)
[2024-06-01 14:09:27] [INFO ] Invariant cache hit.
[2024-06-01 14:09:27] [INFO ] Implicit Places using invariants in 617 ms returned []
[2024-06-01 14:09:27] [INFO ] Flow matrix only has 2004 transitions (discarded 40 similar events)
[2024-06-01 14:09:27] [INFO ] Invariant cache hit.
[2024-06-01 14:09:28] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 14:09:40] [INFO ] Implicit Places using invariants and state equation in 12602 ms returned []
Implicit Place search using SMT with State Equation took 13223 ms to find 0 implicit places.
[2024-06-01 14:09:40] [INFO ] Redundant transitions in 24 ms returned []
Running 2040 sub problems to find dead transitions.
[2024-06-01 14:09:40] [INFO ] Flow matrix only has 2004 transitions (discarded 40 similar events)
[2024-06-01 14:09:40] [INFO ] Invariant cache hit.
[2024-06-01 14:09:40] [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-06-01 14:10:10] [INFO ] Deduced a trap composed of 48 places in 113 ms of which 2 ms to minimize.
[2024-06-01 14:10:10] [INFO ] Deduced a trap composed of 48 places in 108 ms of which 1 ms to minimize.
[2024-06-01 14:10:10] [INFO ] Deduced a trap composed of 48 places in 72 ms of which 2 ms to minimize.
[2024-06-01 14:10:10] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:10:10] [INFO ] Deduced a trap composed of 48 places in 40 ms of which 0 ms to minimize.
[2024-06-01 14:10:10] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:10:10] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:10:10] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 0 ms to minimize.
[2024-06-01 14:10:10] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:10:11] [INFO ] Deduced a trap composed of 268 places in 486 ms of which 4 ms to minimize.
[2024-06-01 14:10:12] [INFO ] Deduced a trap composed of 249 places in 452 ms of which 4 ms to minimize.
[2024-06-01 14:10:13] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:10:16] [INFO ] Deduced a trap composed of 346 places in 416 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 30053 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-06-01 14:10:31] [INFO ] Deduced a trap composed of 46 places in 194 ms of which 3 ms to minimize.
[2024-06-01 14:10:31] [INFO ] Deduced a trap composed of 44 places in 179 ms of which 3 ms to minimize.
[2024-06-01 14:10:32] [INFO ] Deduced a trap composed of 24 places in 186 ms of which 3 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 30032 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 72350ms problems are : Problem set: 0 solved, 2040 unsolved
Search for dead transitions found 0 dead transitions in 72369ms
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 118313 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 66 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 89 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 251 steps (0 resets) in 8 ms. (27 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 85 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 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
[2024-06-01 14:10:53] [INFO ] Flow matrix only has 2004 transitions (discarded 40 similar events)
[2024-06-01 14:10:53] [INFO ] Invariant cache hit.
[2024-06-01 14:10:54] [INFO ] [Real]Absence check using 14 positive place invariants in 18 ms returned sat
[2024-06-01 14:10:54] [INFO ] [Real]Absence check using 14 positive and 30 generalized place invariants in 71 ms returned sat
[2024-06-01 14:10:56] [INFO ] [Real]Absence check using state equation in 2323 ms returned sat
[2024-06-01 14:10:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:10:57] [INFO ] [Nat]Absence check using 14 positive place invariants in 16 ms returned sat
[2024-06-01 14:10:57] [INFO ] [Nat]Absence check using 14 positive and 30 generalized place invariants in 212 ms returned sat
[2024-06-01 14:11:02] [INFO ] [Nat]Absence check using state equation in 4170 ms returned sat
[2024-06-01 14:11:02] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 14:11:02] [INFO ] [Nat]Added 200 Read/Feed constraints in 652 ms returned sat
[2024-06-01 14:11:03] [INFO ] Deduced a trap composed of 46 places in 333 ms of which 4 ms to minimize.
[2024-06-01 14:11:03] [INFO ] Deduced a trap composed of 48 places in 125 ms of which 2 ms to minimize.
[2024-06-01 14:11:04] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 2272 ms
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1690 reset in 641 ms.
Product exploration explored 100000 steps with 1694 reset in 595 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 36 ms. Remains 576 /576 variables (removed 0) and now considering 2044/2044 (removed 0) transitions.
Running 2040 sub problems to find dead transitions.
[2024-06-01 14:11:06] [INFO ] Flow matrix only has 2004 transitions (discarded 40 similar events)
[2024-06-01 14:11:06] [INFO ] Invariant cache hit.
[2024-06-01 14:11:06] [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-06-01 14:11:40] [INFO ] Deduced a trap composed of 48 places in 149 ms of which 2 ms to minimize.
[2024-06-01 14:11:40] [INFO ] Deduced a trap composed of 48 places in 117 ms of which 2 ms to minimize.
[2024-06-01 14:11:40] [INFO ] Deduced a trap composed of 48 places in 87 ms of which 2 ms to minimize.
[2024-06-01 14:11:40] [INFO ] Deduced a trap composed of 48 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:11:40] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:11:40] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:11:40] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:11:41] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:11:41] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:11:41] [INFO ] Deduced a trap composed of 268 places in 464 ms of which 3 ms to minimize.
[2024-06-01 14:11:42] [INFO ] Deduced a trap composed of 249 places in 410 ms of which 4 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 572/2580 variables, and 51 constraints, problems are : Problem set: 0 solved, 2040 unsolved in 20037 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: 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-06-01 14:11:44] [INFO ] Deduced a trap composed of 48 places in 40 ms of which 0 ms to minimize.
[2024-06-01 14:11:53] [INFO ] Deduced a trap composed of 46 places in 175 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/2580 variables, and 53 constraints, problems are : Problem set: 0 solved, 2040 unsolved in 20030 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: 13/13 constraints]
After SMT, in 56553ms problems are : Problem set: 0 solved, 2040 unsolved
Search for dead transitions found 0 dead transitions in 56583ms
[2024-06-01 14:12:02] [INFO ] Flow matrix only has 2004 transitions (discarded 40 similar events)
[2024-06-01 14:12:02] [INFO ] Invariant cache hit.
[2024-06-01 14:12:03] [INFO ] Implicit Places using invariants in 610 ms returned []
[2024-06-01 14:12:03] [INFO ] Flow matrix only has 2004 transitions (discarded 40 similar events)
[2024-06-01 14:12:03] [INFO ] Invariant cache hit.
[2024-06-01 14:12:04] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 14:12:18] [INFO ] Implicit Places using invariants and state equation in 15244 ms returned []
Implicit Place search using SMT with State Equation took 15858 ms to find 0 implicit places.
[2024-06-01 14:12:18] [INFO ] Redundant transitions in 36 ms returned []
Running 2040 sub problems to find dead transitions.
[2024-06-01 14:12:18] [INFO ] Flow matrix only has 2004 transitions (discarded 40 similar events)
[2024-06-01 14:12:18] [INFO ] Invariant cache hit.
[2024-06-01 14:12:18] [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-06-01 14:12:48] [INFO ] Deduced a trap composed of 48 places in 178 ms of which 2 ms to minimize.
[2024-06-01 14:12:48] [INFO ] Deduced a trap composed of 48 places in 128 ms of which 2 ms to minimize.
[2024-06-01 14:12:48] [INFO ] Deduced a trap composed of 48 places in 118 ms of which 2 ms to minimize.
[2024-06-01 14:12:48] [INFO ] Deduced a trap composed of 48 places in 84 ms of which 1 ms to minimize.
[2024-06-01 14:12:48] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 1 ms to minimize.
[2024-06-01 14:12:49] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 2 ms to minimize.
[2024-06-01 14:12:49] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:12:49] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:12:49] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:12:50] [INFO ] Deduced a trap composed of 268 places in 430 ms of which 4 ms to minimize.
[2024-06-01 14:12:50] [INFO ] Deduced a trap composed of 249 places in 558 ms of which 4 ms to minimize.
[2024-06-01 14:12:51] [INFO ] Deduced a trap composed of 48 places in 86 ms of which 2 ms to minimize.
[2024-06-01 14:12:55] [INFO ] Deduced a trap composed of 346 places in 451 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 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: 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-06-01 14:13:12] [INFO ] Deduced a trap composed of 46 places in 211 ms of which 3 ms to minimize.
[2024-06-01 14:13:12] [INFO ] Deduced a trap composed of 44 places in 205 ms of which 2 ms to minimize.
[2024-06-01 14:13:13] [INFO ] Deduced a trap composed of 24 places in 174 ms of which 3 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 30025 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 73452ms problems are : Problem set: 0 solved, 2040 unsolved
Search for dead transitions found 0 dead transitions in 73483ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 146014 ms. Remains : 576/576 places, 2044/2044 transitions.
Treatment of property PolyORBLF-COL-S04J04T10-LTLFireability-02 finished in 417032 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 2 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 2 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 89 ms. Remains 566 /856 variables (removed 290) and now considering 2034/2324 (removed 290) transitions.
Running 2030 sub problems to find dead transitions.
[2024-06-01 14:13:32] [INFO ] Flow matrix only has 1994 transitions (discarded 40 similar events)
// Phase 1: matrix 1994 rows 566 cols
[2024-06-01 14:13:32] [INFO ] Computed 44 invariants in 34 ms
[2024-06-01 14:13:32] [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-06-01 14:14:02] [INFO ] Deduced a trap composed of 47 places in 131 ms of which 2 ms to minimize.
[2024-06-01 14:14:02] [INFO ] Deduced a trap composed of 47 places in 107 ms of which 1 ms to minimize.
[2024-06-01 14:14:02] [INFO ] Deduced a trap composed of 47 places in 117 ms of which 2 ms to minimize.
[2024-06-01 14:14:02] [INFO ] Deduced a trap composed of 47 places in 134 ms of which 1 ms to minimize.
[2024-06-01 14:14:03] [INFO ] Deduced a trap composed of 47 places in 96 ms of which 1 ms to minimize.
[2024-06-01 14:14:03] [INFO ] Deduced a trap composed of 47 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:14:03] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:14:03] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:14:03] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:14:03] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:14:04] [INFO ] Deduced a trap composed of 273 places in 509 ms of which 4 ms to minimize.
[2024-06-01 14:14:04] [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 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 1.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.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 1.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 1.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 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 1.0)
(s161 1.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 1.0)
(s171 1.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)
(s184 0.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 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 1.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 1.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 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 0.0)
(s355 0.0)
(s356 1.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 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 1.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 1.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 0.0)
(s485 0.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
1.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 20033 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-06-01 14:14:12] [INFO ] Deduced a trap composed of 23 places in 184 ms of which 3 ms to minimize.
[2024-06-01 14:14:21] [INFO ] Deduced a trap composed of 300 places in 460 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 20029 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 53489ms problems are : Problem set: 0 solved, 2030 unsolved
Search for dead transitions found 0 dead transitions in 53509ms
[2024-06-01 14:14:26] [INFO ] Flow matrix only has 1994 transitions (discarded 40 similar events)
[2024-06-01 14:14:26] [INFO ] Invariant cache hit.
[2024-06-01 14:14:26] [INFO ] Implicit Places using invariants in 616 ms returned []
[2024-06-01 14:14:26] [INFO ] Flow matrix only has 1994 transitions (discarded 40 similar events)
[2024-06-01 14:14:26] [INFO ] Invariant cache hit.
[2024-06-01 14:14:27] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 14:14:38] [INFO ] Implicit Places using invariants and state equation in 11998 ms returned []
Implicit Place search using SMT with State Equation took 12616 ms to find 0 implicit places.
[2024-06-01 14:14:38] [INFO ] Redundant transitions in 26 ms returned []
Running 2030 sub problems to find dead transitions.
[2024-06-01 14:14:38] [INFO ] Flow matrix only has 1994 transitions (discarded 40 similar events)
[2024-06-01 14:14:38] [INFO ] Invariant cache hit.
[2024-06-01 14:14:38] [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-06-01 14:15:09] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 1 ms to minimize.
[2024-06-01 14:15:09] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 0 ms to minimize.
[2024-06-01 14:15:09] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:15:09] [INFO ] Deduced a trap composed of 47 places in 38 ms of which 0 ms to minimize.
[2024-06-01 14:15:09] [INFO ] Deduced a trap composed of 47 places in 32 ms of which 1 ms to minimize.
[2024-06-01 14:15:09] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:15:09] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:15:09] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 1 ms to minimize.
[2024-06-01 14:15:09] [INFO ] Deduced a trap composed of 47 places in 31 ms of which 1 ms to minimize.
[2024-06-01 14:15:10] [INFO ] Deduced a trap composed of 254 places in 399 ms of which 3 ms to minimize.
[2024-06-01 14:15:10] [INFO ] Deduced a trap composed of 222 places in 325 ms of which 3 ms to minimize.
[2024-06-01 14:15:11] [INFO ] Deduced a trap composed of 47 places in 35 ms of which 1 ms to minimize.
[2024-06-01 14:15:14] [INFO ] Deduced a trap composed of 300 places in 268 ms of which 3 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 30028 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-06-01 14:15:28] [INFO ] Deduced a trap composed of 93 places in 366 ms of which 4 ms to minimize.
[2024-06-01 14:15:33] [INFO ] Deduced a trap composed of 47 places in 191 ms of which 3 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 30039 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 74058ms problems are : Problem set: 0 solved, 2030 unsolved
Search for dead transitions found 0 dead transitions in 74083ms
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 140343 ms. Remains : 566/856 places, 2034/2324 transitions.
Stuttering acceptance computed with spot in 121 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 3434 steps with 0 reset in 35 ms.
FORMULA PolyORBLF-COL-S04J04T10-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S04J04T10-LTLFireability-03 finished in 140528 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 62 ms. Remains 836 /856 variables (removed 20) and now considering 2304/2324 (removed 20) transitions.
Running 2300 sub problems to find dead transitions.
[2024-06-01 14:15:53] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
// Phase 1: matrix 2264 rows 836 cols
[2024-06-01 14:15:53] [INFO ] Computed 44 invariants in 56 ms
[2024-06-01 14:15: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
SMT process timed out in 33484ms, After SMT, problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 33508ms
[2024-06-01 14:16:26] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-06-01 14:16:26] [INFO ] Invariant cache hit.
[2024-06-01 14:16:27] [INFO ] Implicit Places using invariants in 749 ms returned []
[2024-06-01 14:16:27] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-06-01 14:16:27] [INFO ] Invariant cache hit.
[2024-06-01 14:16:28] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 14:16:55] [INFO ] Implicit Places using invariants and state equation in 28632 ms returned []
Implicit Place search using SMT with State Equation took 29382 ms to find 0 implicit places.
Running 2300 sub problems to find dead transitions.
[2024-06-01 14:16:55] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-06-01 14:16:55] [INFO ] Invariant cache hit.
[2024-06-01 14:16:55] [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-06-01 14:17:32] [INFO ] Deduced a trap composed of 74 places in 109 ms of which 2 ms to minimize.
[2024-06-01 14:17:32] [INFO ] Deduced a trap composed of 74 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:17:32] [INFO ] Deduced a trap composed of 74 places in 75 ms of which 2 ms to minimize.
[2024-06-01 14:17:32] [INFO ] Deduced a trap composed of 74 places in 79 ms of which 2 ms to minimize.
[2024-06-01 14:17:32] [INFO ] Deduced a trap composed of 74 places in 83 ms of which 2 ms to minimize.
[2024-06-01 14:17:32] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 1 ms to minimize.
[2024-06-01 14:17:32] [INFO ] Deduced a trap composed of 74 places in 92 ms of which 3 ms to minimize.
[2024-06-01 14:17:33] [INFO ] Deduced a trap composed of 74 places in 81 ms of which 1 ms to minimize.
[2024-06-01 14:17:33] [INFO ] Deduced a trap composed of 74 places in 74 ms of which 2 ms to minimize.
[2024-06-01 14:17:34] [INFO ] Deduced a trap composed of 489 places in 597 ms of which 7 ms to minimize.
[2024-06-01 14:17:34] [INFO ] Deduced a trap composed of 511 places in 493 ms of which 6 ms to minimize.
[2024-06-01 14:17:35] [INFO ] Deduced a trap composed of 223 places in 509 ms of which 6 ms to minimize.
[2024-06-01 14:17:35] [INFO ] Deduced a trap composed of 74 places in 81 ms of which 3 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 30092 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-06-01 14:17:44] [INFO ] Deduced a trap composed of 411 places in 477 ms of which 5 ms to minimize.
[2024-06-01 14:17:47] [INFO ] Deduced a trap composed of 579 places in 509 ms of which 5 ms to minimize.
[2024-06-01 14:17:47] [INFO ] Deduced a trap composed of 510 places in 540 ms of which 6 ms to minimize.
[2024-06-01 14:17:48] [INFO ] Deduced a trap composed of 498 places in 515 ms of which 6 ms to minimize.
[2024-06-01 14:17:48] [INFO ] Deduced a trap composed of 507 places in 472 ms of which 6 ms to minimize.
[2024-06-01 14:17:53] [INFO ] Deduced a trap composed of 455 places in 481 ms of which 5 ms to minimize.
[2024-06-01 14:17:53] [INFO ] Deduced a trap composed of 480 places in 469 ms of which 5 ms to minimize.
[2024-06-01 14:17:54] [INFO ] Deduced a trap composed of 492 places in 468 ms of which 5 ms to minimize.
[2024-06-01 14:17:58] [INFO ] Deduced a trap composed of 79 places in 309 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 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: 0/2300 constraints, Known Traps: 22/22 constraints]
After SMT, in 72814ms problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 72837ms
Starting structural reductions in LTL mode, iteration 1 : 836/856 places, 2304/2324 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 135804 ms. Remains : 836/856 places, 2304/2324 transitions.
Stuttering acceptance computed with spot in 105 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 135928 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 10 ms. Remains 856 /856 variables (removed 0) and now considering 2324/2324 (removed 0) transitions.
Running 2320 sub problems to find dead transitions.
[2024-06-01 14:18:08] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
// Phase 1: matrix 2284 rows 856 cols
[2024-06-01 14:18:08] [INFO ] Computed 44 invariants in 66 ms
[2024-06-01 14:18:09] [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 33248ms, After SMT, problems are : Problem set: 0 solved, 2320 unsolved
Search for dead transitions found 0 dead transitions in 33273ms
[2024-06-01 14:18:42] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
[2024-06-01 14:18:42] [INFO ] Invariant cache hit.
[2024-06-01 14:18:42] [INFO ] Implicit Places using invariants in 662 ms returned []
[2024-06-01 14:18:42] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
[2024-06-01 14:18:42] [INFO ] Invariant cache hit.
[2024-06-01 14:18:43] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 14:19:00] [INFO ] Implicit Places using invariants and state equation in 17538 ms returned []
Implicit Place search using SMT with State Equation took 18203 ms to find 0 implicit places.
Running 2320 sub problems to find dead transitions.
[2024-06-01 14:19:00] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
[2024-06-01 14:19:00] [INFO ] Invariant cache hit.
[2024-06-01 14:19:00] [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-06-01 14:19:39] [INFO ] Deduced a trap composed of 76 places in 74 ms of which 2 ms to minimize.
[2024-06-01 14:19:39] [INFO ] Deduced a trap composed of 76 places in 92 ms of which 2 ms to minimize.
[2024-06-01 14:19:39] [INFO ] Deduced a trap composed of 76 places in 80 ms of which 1 ms to minimize.
[2024-06-01 14:19:39] [INFO ] Deduced a trap composed of 76 places in 105 ms of which 2 ms to minimize.
[2024-06-01 14:19:43] [INFO ] Deduced a trap composed of 76 places in 616 ms of which 6 ms to minimize.
[2024-06-01 14:19:43] [INFO ] Deduced a trap composed of 266 places in 548 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 852/3140 variables, and 46 constraints, problems are : Problem set: 0 solved, 2320 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 11/13 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/856 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2320/2320 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2320 unsolved
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
At refinement iteration 2 (INCLUDED_ONLY) 0/852 variables, 6/46 constraints. Problems are: Problem set: 0 solved, 2320 unsolved
[2024-06-01 14:19:46] [INFO ] Deduced a trap composed of 77 places in 177 ms of which 2 ms to minimize.
[2024-06-01 14:19:46] [INFO ] Deduced a trap composed of 77 places in 188 ms of which 3 ms to minimize.
[2024-06-01 14:19:46] [INFO ] Deduced a trap composed of 76 places in 101 ms of which 1 ms to minimize.
[2024-06-01 14:19:47] [INFO ] Deduced a trap composed of 76 places in 79 ms of which 1 ms to minimize.
[2024-06-01 14:19:55] [INFO ] Deduced a trap composed of 76 places in 68 ms of which 1 ms to minimize.
[2024-06-01 14:20:04] [INFO ] Deduced a trap composed of 23 places in 245 ms of which 3 ms to minimize.
[2024-06-01 14:20:05] [INFO ] Deduced a trap composed of 514 places in 441 ms of which 5 ms to minimize.
[2024-06-01 14:20:05] [INFO ] Deduced a trap composed of 513 places in 526 ms of which 6 ms to minimize.
[2024-06-01 14:20:10] [INFO ] Deduced a trap composed of 509 places in 543 ms of which 9 ms to minimize.
[2024-06-01 14:20:11] [INFO ] Deduced a trap composed of 464 places in 669 ms of which 8 ms to minimize.
[2024-06-01 14:20:11] [INFO ] Deduced a trap composed of 527 places in 602 ms of which 6 ms to minimize.
[2024-06-01 14:20:12] [INFO ] Deduced a trap composed of 519 places in 551 ms of which 4 ms to minimize.
[2024-06-01 14:20:13] [INFO ] Deduced a trap composed of 486 places in 622 ms of which 6 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 852/3140 variables, and 59 constraints, problems are : Problem set: 0 solved, 2320 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 11/13 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/856 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2320 constraints, Known Traps: 19/19 constraints]
After SMT, in 73891ms problems are : Problem set: 0 solved, 2320 unsolved
Search for dead transitions found 0 dead transitions in 73932ms
Finished structural reductions in LTL mode , in 1 iterations and 125435 ms. Remains : 856/856 places, 2324/2324 transitions.
Stuttering acceptance computed with spot in 202 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 3176 reset in 639 ms.
Product exploration explored 100000 steps with 3212 reset in 526 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 138 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 262 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), false, false, false]
RANDOM walk for 40000 steps (8 resets) in 309 ms. (129 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1707 ms. (23 steps per ms) remains 1/1 properties
[2024-06-01 14:20:16] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
[2024-06-01 14:20:16] [INFO ] Invariant cache hit.
[2024-06-01 14:20:16] [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-06-01 14:20:17] [INFO ] Deduced a trap composed of 76 places in 202 ms of which 4 ms to minimize.
[2024-06-01 14:20:17] [INFO ] Deduced a trap composed of 76 places in 187 ms of which 3 ms to minimize.
[2024-06-01 14:20:17] [INFO ] Deduced a trap composed of 76 places in 117 ms of which 2 ms to minimize.
[2024-06-01 14:20:17] [INFO ] Deduced a trap composed of 77 places in 96 ms of which 2 ms to minimize.
[2024-06-01 14:20:17] [INFO ] Deduced a trap composed of 77 places in 96 ms of which 2 ms to minimize.
[2024-06-01 14:20:17] [INFO ] Deduced a trap composed of 77 places in 92 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-06-01 14:20:17] [INFO ] Deduced a trap composed of 77 places in 104 ms of which 2 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 1592 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 1622ms 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 291 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 218 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), false, false, false]
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), false, false, false]
[2024-06-01 14:20:19] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
[2024-06-01 14:20:19] [INFO ] Invariant cache hit.
[2024-06-01 14:20:20] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-06-01 14:20:20] [INFO ] [Real]Absence check using 13 positive and 31 generalized place invariants in 103 ms returned sat
[2024-06-01 14:20:22] [INFO ] [Real]Absence check using state equation in 1847 ms returned sat
[2024-06-01 14:20:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:20:23] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-06-01 14:20:23] [INFO ] [Nat]Absence check using 13 positive and 31 generalized place invariants in 120 ms returned sat
[2024-06-01 14:20:29] [INFO ] [Nat]Absence check using state equation in 5550 ms returned sat
[2024-06-01 14:20:29] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 14:20:29] [INFO ] [Nat]Added 200 Read/Feed constraints in 746 ms returned sat
[2024-06-01 14:20:30] [INFO ] Computed and/alt/rep : 1350/3496/1320 causal constraints (skipped 960 transitions) in 231 ms.
[2024-06-01 14:20:34] [INFO ] Added : 113 causal constraints over 23 iterations in 4571 ms. Result :sat
Could not prove EG (NOT p0)
[2024-06-01 14:20:34] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
[2024-06-01 14:20:34] [INFO ] Invariant cache hit.
[2024-06-01 14:20:36] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-06-01 14:20:36] [INFO ] [Real]Absence check using 13 positive and 31 generalized place invariants in 88 ms returned sat
[2024-06-01 14:20:38] [INFO ] [Real]Absence check using state equation in 1994 ms returned sat
[2024-06-01 14:20:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:20:39] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-06-01 14:20:39] [INFO ] [Nat]Absence check using 13 positive and 31 generalized place invariants in 68 ms returned sat
[2024-06-01 14:20:44] [INFO ] [Nat]Absence check using state equation in 4650 ms returned sat
[2024-06-01 14:20:44] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 14:20:46] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 14:20:46] [INFO ] [Nat]Added 200 Read/Feed constraints in 2070 ms returned sat
[2024-06-01 14:20:46] [INFO ] Deduced a trap composed of 76 places in 116 ms of which 2 ms to minimize.
[2024-06-01 14:20:48] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 1765 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 1 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 1 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 87 ms. Remains 596 /856 variables (removed 260) and now considering 2064/2324 (removed 260) transitions.
Running 2060 sub problems to find dead transitions.
[2024-06-01 14:20:48] [INFO ] Flow matrix only has 2024 transitions (discarded 40 similar events)
// Phase 1: matrix 2024 rows 596 cols
[2024-06-01 14:20:48] [INFO ] Computed 44 invariants in 60 ms
[2024-06-01 14:20:48] [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-06-01 14:21:19] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 1 ms to minimize.
[2024-06-01 14:21:19] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 2 ms to minimize.
[2024-06-01 14:21:19] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:21:19] [INFO ] Deduced a trap composed of 50 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:21:19] [INFO ] Deduced a trap composed of 50 places in 42 ms of which 1 ms to minimize.
[2024-06-01 14:21:19] [INFO ] Deduced a trap composed of 50 places in 39 ms of which 0 ms to minimize.
[2024-06-01 14:21:19] [INFO ] Deduced a trap composed of 50 places in 40 ms of which 1 ms to minimize.
[2024-06-01 14:21:19] [INFO ] Deduced a trap composed of 50 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:21:20] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:21:20] [INFO ] Deduced a trap composed of 245 places in 291 ms of which 3 ms to minimize.
[2024-06-01 14:21:21] [INFO ] Deduced a trap composed of 261 places in 414 ms of which 5 ms to minimize.
[2024-06-01 14:21:21] [INFO ] Deduced a trap composed of 23 places in 327 ms of which 3 ms to minimize.
[2024-06-01 14:21:21] [INFO ] Deduced a trap composed of 256 places in 404 ms of which 3 ms to minimize.
[2024-06-01 14:21:22] [INFO ] Deduced a trap composed of 293 places in 345 ms of which 3 ms to minimize.
[2024-06-01 14:21:22] [INFO ] Deduced a trap composed of 269 places in 406 ms of which 4 ms to minimize.
[2024-06-01 14:21:23] [INFO ] Deduced a trap composed of 236 places in 452 ms of which 4 ms to minimize.
[2024-06-01 14:21:23] [INFO ] Deduced a trap composed of 245 places in 422 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2620 variables, and 57 constraints, problems are : Problem set: 0 solved, 2060 unsolved in 20040 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: 17/17 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, 17/57 constraints. Problems are: Problem set: 0 solved, 2060 unsolved
[2024-06-01 14:21:25] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 592/2620 variables, and 58 constraints, problems are : Problem set: 0 solved, 2060 unsolved in 20031 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: 18/18 constraints]
After SMT, in 55348ms problems are : Problem set: 0 solved, 2060 unsolved
Search for dead transitions found 0 dead transitions in 55369ms
[2024-06-01 14:21:43] [INFO ] Flow matrix only has 2024 transitions (discarded 40 similar events)
[2024-06-01 14:21:43] [INFO ] Invariant cache hit.
[2024-06-01 14:21:44] [INFO ] Implicit Places using invariants in 498 ms returned []
[2024-06-01 14:21:44] [INFO ] Flow matrix only has 2024 transitions (discarded 40 similar events)
[2024-06-01 14:21:44] [INFO ] Invariant cache hit.
[2024-06-01 14:21:45] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 14:22:03] [INFO ] Implicit Places using invariants and state equation in 19018 ms returned []
Implicit Place search using SMT with State Equation took 19519 ms to find 0 implicit places.
[2024-06-01 14:22:03] [INFO ] Redundant transitions in 29 ms returned []
Running 2060 sub problems to find dead transitions.
[2024-06-01 14:22:03] [INFO ] Flow matrix only has 2024 transitions (discarded 40 similar events)
[2024-06-01 14:22:03] [INFO ] Invariant cache hit.
[2024-06-01 14:22:03] [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-06-01 14:22:34] [INFO ] Deduced a trap composed of 50 places in 171 ms of which 2 ms to minimize.
[2024-06-01 14:22:34] [INFO ] Deduced a trap composed of 50 places in 147 ms of which 2 ms to minimize.
[2024-06-01 14:22:35] [INFO ] Deduced a trap composed of 50 places in 119 ms of which 2 ms to minimize.
[2024-06-01 14:22:35] [INFO ] Deduced a trap composed of 50 places in 90 ms of which 2 ms to minimize.
[2024-06-01 14:22:35] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 2 ms to minimize.
[2024-06-01 14:22:35] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 1 ms to minimize.
[2024-06-01 14:22:35] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:22:35] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 1 ms to minimize.
[2024-06-01 14:22:35] [INFO ] Deduced a trap composed of 50 places in 64 ms of which 1 ms to minimize.
[2024-06-01 14:22:36] [INFO ] Deduced a trap composed of 239 places in 443 ms of which 5 ms to minimize.
[2024-06-01 14:22:37] [INFO ] Deduced a trap composed of 232 places in 431 ms of which 4 ms to minimize.
[2024-06-01 14:22:37] [INFO ] Deduced a trap composed of 240 places in 443 ms of which 4 ms to minimize.
[2024-06-01 14:22:38] [INFO ] Deduced a trap composed of 223 places in 436 ms of which 4 ms to minimize.
[2024-06-01 14:22:40] [INFO ] Deduced a trap composed of 77 places in 282 ms of which 2 ms to minimize.
[2024-06-01 14:22:40] [INFO ] Deduced a trap composed of 50 places in 65 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 30034 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-06-01 14:23:02] [INFO ] Deduced a trap composed of 330 places in 332 ms of which 4 ms to minimize.
[2024-06-01 14:23:05] [INFO ] Deduced a trap composed of 23 places in 218 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 592/2620 variables, and 57 constraints, problems are : Problem set: 0 solved, 2060 unsolved in 30039 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 75350ms problems are : Problem set: 0 solved, 2060 unsolved
Search for dead transitions found 0 dead transitions in 75389ms
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 150422 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 208 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 295 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), false, false, false]
RANDOM walk for 40000 steps (8 resets) in 637 ms. (62 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 412 ms. (96 steps per ms) remains 1/1 properties
[2024-06-01 14:23:19] [INFO ] Flow matrix only has 2024 transitions (discarded 40 similar events)
[2024-06-01 14:23:19] [INFO ] Invariant cache hit.
[2024-06-01 14:23:19] [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-06-01 14:23:20] [INFO ] Deduced a trap composed of 50 places in 158 ms of which 2 ms to minimize.
[2024-06-01 14:23:20] [INFO ] Deduced a trap composed of 51 places in 171 ms of which 2 ms to minimize.
[2024-06-01 14:23:20] [INFO ] Deduced a trap composed of 50 places in 132 ms of which 1 ms to minimize.
[2024-06-01 14:23:20] [INFO ] Deduced a trap composed of 50 places in 96 ms of which 1 ms to minimize.
[2024-06-01 14:23:20] [INFO ] Deduced a trap composed of 50 places in 91 ms of which 1 ms to minimize.
[2024-06-01 14:23:20] [INFO ] Deduced a trap composed of 50 places in 51 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 1271 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 1330ms 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 484 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 276 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), false, false, false]
Stuttering acceptance computed with spot in 292 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), false, false, false]
[2024-06-01 14:23:22] [INFO ] Flow matrix only has 2024 transitions (discarded 40 similar events)
[2024-06-01 14:23:22] [INFO ] Invariant cache hit.
[2024-06-01 14:23:23] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-06-01 14:23:23] [INFO ] [Real]Absence check using 13 positive and 31 generalized place invariants in 299 ms returned sat
[2024-06-01 14:23:25] [INFO ] [Real]Absence check using state equation in 1827 ms returned sat
[2024-06-01 14:23:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:23:27] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-06-01 14:23:27] [INFO ] [Nat]Absence check using 13 positive and 31 generalized place invariants in 93 ms returned sat
[2024-06-01 14:23:30] [INFO ] [Nat]Absence check using state equation in 2696 ms returned sat
[2024-06-01 14:23:30] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 14:23:30] [INFO ] [Nat]Added 200 Read/Feed constraints in 896 ms returned sat
[2024-06-01 14:23:31] [INFO ] Computed and/alt/rep : 990/2806/960 causal constraints (skipped 1060 transitions) in 174 ms.
[2024-06-01 14:23:32] [INFO ] Added : 36 causal constraints over 8 iterations in 1484 ms. Result :sat
Could not prove EG (NOT p1)
[2024-06-01 14:23:32] [INFO ] Flow matrix only has 2024 transitions (discarded 40 similar events)
[2024-06-01 14:23:32] [INFO ] Invariant cache hit.
[2024-06-01 14:23:33] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-06-01 14:23:33] [INFO ] [Real]Absence check using 13 positive and 31 generalized place invariants in 144 ms returned sat
[2024-06-01 14:23:36] [INFO ] [Real]Absence check using state equation in 3274 ms returned sat
[2024-06-01 14:23:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:23:38] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-06-01 14:23:38] [INFO ] [Nat]Absence check using 13 positive and 31 generalized place invariants in 61 ms returned sat
[2024-06-01 14:23:42] [INFO ] [Nat]Absence check using state equation in 4381 ms returned sat
[2024-06-01 14:23:42] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 14:23:44] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 14:23:44] [INFO ] [Nat]Added 200 Read/Feed constraints in 1710 ms returned sat
[2024-06-01 14:23:44] [INFO ] Deduced a trap composed of 50 places in 125 ms of which 2 ms to minimize.
[2024-06-01 14:23:45] [INFO ] Deduced a trap composed of 50 places in 135 ms of which 2 ms to minimize.
[2024-06-01 14:23:45] [INFO ] Deduced a trap composed of 50 places in 133 ms of which 2 ms to minimize.
[2024-06-01 14:23:46] [INFO ] Deduced a trap composed of 50 places in 100 ms of which 2 ms to minimize.
[2024-06-01 14:23:47] [INFO ] Deduced a trap composed of 50 places in 98 ms of which 1 ms to minimize.
[2024-06-01 14:23:47] [INFO ] Deduced a trap composed of 50 places in 86 ms of which 1 ms to minimize.
[2024-06-01 14:23:48] [INFO ] Deduced a trap composed of 50 places in 70 ms of which 1 ms to minimize.
[2024-06-01 14:23:48] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4570 ms
[2024-06-01 14:23:49] [INFO ] Computed and/alt/rep : 990/2806/960 causal constraints (skipped 1060 transitions) in 205 ms.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 299 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), false, false, false]
Product exploration explored 100000 steps with 3772 reset in 747 ms.
Product exploration explored 100000 steps with 3784 reset in 605 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 2 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 43 ms. Remains 576 /596 variables (removed 20) and now considering 2044/2064 (removed 20) transitions.
Running 2040 sub problems to find dead transitions.
[2024-06-01 14:23:53] [INFO ] Flow matrix only has 2004 transitions (discarded 40 similar events)
// Phase 1: matrix 2004 rows 576 cols
[2024-06-01 14:23:53] [INFO ] Computed 44 invariants in 60 ms
[2024-06-01 14:23:53] [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-06-01 14:24:24] [INFO ] Deduced a trap composed of 48 places in 171 ms of which 2 ms to minimize.
[2024-06-01 14:24:24] [INFO ] Deduced a trap composed of 48 places in 118 ms of which 2 ms to minimize.
[2024-06-01 14:24:24] [INFO ] Deduced a trap composed of 48 places in 118 ms of which 2 ms to minimize.
[2024-06-01 14:24:24] [INFO ] Deduced a trap composed of 48 places in 73 ms of which 2 ms to minimize.
[2024-06-01 14:24:24] [INFO ] Deduced a trap composed of 48 places in 79 ms of which 1 ms to minimize.
[2024-06-01 14:24:24] [INFO ] Deduced a trap composed of 48 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:24:24] [INFO ] Deduced a trap composed of 48 places in 141 ms of which 2 ms to minimize.
[2024-06-01 14:24:24] [INFO ] Deduced a trap composed of 48 places in 95 ms of which 1 ms to minimize.
[2024-06-01 14:24:24] [INFO ] Deduced a trap composed of 48 places in 84 ms of which 2 ms to minimize.
[2024-06-01 14:24:25] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:24:25] [INFO ] Deduced a trap composed of 243 places in 413 ms of which 4 ms to minimize.
[2024-06-01 14:24:26] [INFO ] Deduced a trap composed of 237 places in 371 ms of which 4 ms to minimize.
[2024-06-01 14:24:26] [INFO ] Deduced a trap composed of 240 places in 396 ms of which 4 ms to minimize.
[2024-06-01 14:24:27] [INFO ] Deduced a trap composed of 261 places in 368 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 572/2580 variables, and 54 constraints, problems are : Problem set: 0 solved, 2040 unsolved in 20029 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: 14/14 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, 14/54 constraints. Problems are: Problem set: 0 solved, 2040 unsolved
[2024-06-01 14:24:30] [INFO ] Deduced a trap composed of 39 places in 269 ms of which 2 ms to minimize.
[2024-06-01 14:24:31] [INFO ] Deduced a trap composed of 23 places in 204 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 572/2580 variables, and 56 constraints, problems are : Problem set: 0 solved, 2040 unsolved in 20051 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: 16/16 constraints]
After SMT, in 54107ms problems are : Problem set: 0 solved, 2040 unsolved
Search for dead transitions found 0 dead transitions in 54129ms
[2024-06-01 14:24:47] [INFO ] Flow matrix only has 2004 transitions (discarded 40 similar events)
[2024-06-01 14:24:47] [INFO ] Invariant cache hit.
[2024-06-01 14:24:48] [INFO ] Implicit Places using invariants in 662 ms returned []
[2024-06-01 14:24:48] [INFO ] Flow matrix only has 2004 transitions (discarded 40 similar events)
[2024-06-01 14:24:48] [INFO ] Invariant cache hit.
[2024-06-01 14:24:49] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 14:25:00] [INFO ] Implicit Places using invariants and state equation in 11766 ms returned []
Implicit Place search using SMT with State Equation took 12429 ms to find 0 implicit places.
[2024-06-01 14:25:00] [INFO ] Redundant transitions in 24 ms returned []
Running 2040 sub problems to find dead transitions.
[2024-06-01 14:25:00] [INFO ] Flow matrix only has 2004 transitions (discarded 40 similar events)
[2024-06-01 14:25:00] [INFO ] Invariant cache hit.
[2024-06-01 14:25:00] [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-06-01 14:25:30] [INFO ] Deduced a trap composed of 48 places in 212 ms of which 4 ms to minimize.
[2024-06-01 14:25:31] [INFO ] Deduced a trap composed of 39 places in 236 ms of which 2 ms to minimize.
[2024-06-01 14:25:31] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:25:31] [INFO ] Deduced a trap composed of 48 places in 38 ms of which 0 ms to minimize.
[2024-06-01 14:25:31] [INFO ] Deduced a trap composed of 48 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:25:31] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 0 ms to minimize.
[2024-06-01 14:25:31] [INFO ] Deduced a trap composed of 48 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:25:31] [INFO ] Deduced a trap composed of 48 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:25:31] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:25:31] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:25:32] [INFO ] Deduced a trap composed of 243 places in 368 ms of which 4 ms to minimize.
[2024-06-01 14:25:32] [INFO ] Deduced a trap composed of 245 places in 479 ms of which 5 ms to minimize.
[2024-06-01 14:25:33] [INFO ] Deduced a trap composed of 277 places in 462 ms of which 3 ms to minimize.
[2024-06-01 14:25:33] [INFO ] Deduced a trap composed of 272 places in 406 ms of which 4 ms to minimize.
[2024-06-01 14:25:34] [INFO ] Deduced a trap composed of 260 places in 492 ms of which 5 ms to minimize.
[2024-06-01 14:25:34] [INFO ] Deduced a trap composed of 290 places in 455 ms of which 4 ms to minimize.
[2024-06-01 14:25:35] [INFO ] Deduced a trap composed of 233 places in 444 ms of which 3 ms to minimize.
[2024-06-01 14:25:35] [INFO ] Deduced a trap composed of 68 places in 361 ms of which 3 ms to minimize.
[2024-06-01 14:25:35] [INFO ] Deduced a trap composed of 249 places in 404 ms of which 4 ms to minimize.
[2024-06-01 14:25:36] [INFO ] Deduced a trap composed of 48 places in 48 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-06-01 14:25:40] [INFO ] Deduced a trap composed of 310 places in 384 ms of which 6 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 572/2580 variables, and 61 constraints, problems are : Problem set: 0 solved, 2040 unsolved in 30062 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-06-01 14:26:07] [INFO ] Deduced a trap composed of 220 places in 344 ms of which 3 ms to minimize.
[2024-06-01 14:26:08] [INFO ] Deduced a trap composed of 247 places in 314 ms of which 4 ms to minimize.
[2024-06-01 14:26:08] [INFO ] Deduced a trap composed of 253 places in 335 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/2580 variables, and 64 constraints, problems are : Problem set: 0 solved, 2040 unsolved in 30026 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: 24/24 constraints]
After SMT, in 74231ms problems are : Problem set: 0 solved, 2040 unsolved
Search for dead transitions found 0 dead transitions in 74258ms
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 140901 ms. Remains : 576/596 places, 2044/2064 transitions.
Treatment of property PolyORBLF-COL-S04J04T10-LTLFireability-07 finished in 485873 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 33 ms. Remains 836 /856 variables (removed 20) and now considering 2304/2324 (removed 20) transitions.
Running 2300 sub problems to find dead transitions.
[2024-06-01 14:26:14] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
// Phase 1: matrix 2264 rows 836 cols
[2024-06-01 14:26:14] [INFO ] Computed 44 invariants in 65 ms
[2024-06-01 14:26:14] [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 34133ms, After SMT, problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 34167ms
[2024-06-01 14:26:48] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-06-01 14:26:48] [INFO ] Invariant cache hit.
[2024-06-01 14:26:49] [INFO ] Implicit Places using invariants in 657 ms returned []
[2024-06-01 14:26:49] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-06-01 14:26:49] [INFO ] Invariant cache hit.
[2024-06-01 14:26:50] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 14:27:10] [INFO ] Implicit Places using invariants and state equation in 20405 ms returned []
Implicit Place search using SMT with State Equation took 21063 ms to find 0 implicit places.
Running 2300 sub problems to find dead transitions.
[2024-06-01 14:27:10] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-06-01 14:27:10] [INFO ] Invariant cache hit.
[2024-06-01 14:27: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-06-01 14:27:47] [INFO ] Deduced a trap composed of 74 places in 105 ms of which 2 ms to minimize.
[2024-06-01 14:27:47] [INFO ] Deduced a trap composed of 74 places in 73 ms of which 1 ms to minimize.
[2024-06-01 14:27:47] [INFO ] Deduced a trap composed of 74 places in 70 ms of which 1 ms to minimize.
[2024-06-01 14:27:47] [INFO ] Deduced a trap composed of 74 places in 75 ms of which 1 ms to minimize.
[2024-06-01 14:27:47] [INFO ] Deduced a trap composed of 74 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:27:47] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 0 ms to minimize.
[2024-06-01 14:27:47] [INFO ] Deduced a trap composed of 74 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:27:47] [INFO ] Deduced a trap composed of 74 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:27:47] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:27:49] [INFO ] Deduced a trap composed of 489 places in 521 ms of which 5 ms to minimize.
[2024-06-01 14:27:49] [INFO ] Deduced a trap composed of 511 places in 504 ms of which 6 ms to minimize.
[2024-06-01 14:27:50] [INFO ] Deduced a trap composed of 223 places in 506 ms of which 5 ms to minimize.
[2024-06-01 14:27:50] [INFO ] Deduced a trap composed of 74 places in 72 ms of which 2 ms to minimize.
[2024-06-01 14:27:53] [INFO ] Deduced a trap composed of 99 places in 285 ms of which 3 ms to minimize.
SMT process timed out in 43295ms, After SMT, problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 43317ms
Starting structural reductions in LTL mode, iteration 1 : 836/856 places, 2304/2324 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 98593 ms. Remains : 836/856 places, 2304/2324 transitions.
Stuttering acceptance computed with spot in 191 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 716 ms.
Product exploration explored 100000 steps with 33333 reset in 813 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 21 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 100383 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 60 ms. Remains 836 /856 variables (removed 20) and now considering 2304/2324 (removed 20) transitions.
Running 2300 sub problems to find dead transitions.
[2024-06-01 14:27:55] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-06-01 14:27:55] [INFO ] Invariant cache hit.
[2024-06-01 14:27:55] [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 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 1.0)
(s20 0.0)
(s21 0.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 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 1.0)
(s408 1.0)
(s413 0.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 timeout
1.0)
(s446 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 32785ms, After SMT, problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 32813ms
[2024-06-01 14:28:28] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-06-01 14:28:28] [INFO ] Invariant cache hit.
[2024-06-01 14:28:28] [INFO ] Implicit Places using invariants in 571 ms returned []
[2024-06-01 14:28:28] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-06-01 14:28:28] [INFO ] Invariant cache hit.
[2024-06-01 14:28:29] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 14:28:47] [INFO ] Implicit Places using invariants and state equation in 18893 ms returned []
Implicit Place search using SMT with State Equation took 19465 ms to find 0 implicit places.
Running 2300 sub problems to find dead transitions.
[2024-06-01 14:28:47] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-06-01 14:28:47] [INFO ] Invariant cache hit.
[2024-06-01 14:28:47] [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-06-01 14:29:25] [INFO ] Deduced a trap composed of 74 places in 73 ms of which 2 ms to minimize.
[2024-06-01 14:29:25] [INFO ] Deduced a trap composed of 74 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:29:25] [INFO ] Deduced a trap composed of 74 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:29:26] [INFO ] Deduced a trap composed of 74 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:29:26] [INFO ] Deduced a trap composed of 74 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:29:26] [INFO ] Deduced a trap composed of 74 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:29:26] [INFO ] Deduced a trap composed of 74 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:29:26] [INFO ] Deduced a trap composed of 74 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:29:26] [INFO ] Deduced a trap composed of 74 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:29:27] [INFO ] Deduced a trap composed of 489 places in 419 ms of which 5 ms to minimize.
[2024-06-01 14:29:27] [INFO ] Deduced a trap composed of 511 places in 447 ms of which 5 ms to minimize.
[2024-06-01 14:29:28] [INFO ] Deduced a trap composed of 223 places in 456 ms of which 5 ms to minimize.
[2024-06-01 14:29:28] [INFO ] Deduced a trap composed of 74 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:29:31] [INFO ] Deduced a trap composed of 99 places in 370 ms of which 3 ms to minimize.
SMT process timed out in 44040ms, After SMT, problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 44060ms
Starting structural reductions in LTL mode, iteration 1 : 836/856 places, 2304/2324 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 96408 ms. Remains : 836/856 places, 2304/2324 transitions.
Stuttering acceptance computed with spot in 133 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 13376 steps with 0 reset in 72 ms.
FORMULA PolyORBLF-COL-S04J04T10-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S04J04T10-LTLFireability-11 finished in 96640 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 1 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 1 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 98 ms. Remains 556 /856 variables (removed 300) and now considering 2024/2324 (removed 300) transitions.
Running 2020 sub problems to find dead transitions.
[2024-06-01 14:29:31] [INFO ] Flow matrix only has 1984 transitions (discarded 40 similar events)
// Phase 1: matrix 1984 rows 556 cols
[2024-06-01 14:29:31] [INFO ] Computed 44 invariants in 56 ms
[2024-06-01 14:29:31] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2020 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/552 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 2020 unsolved
[2024-06-01 14:30:00] [INFO ] Deduced a trap composed of 46 places in 173 ms of which 2 ms to minimize.
[2024-06-01 14:30:00] [INFO ] Deduced a trap composed of 46 places in 93 ms of which 1 ms to minimize.
[2024-06-01 14:30:01] [INFO ] Deduced a trap composed of 46 places in 76 ms of which 2 ms to minimize.
[2024-06-01 14:30:01] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:30:01] [INFO ] Deduced a trap composed of 46 places in 34 ms of which 0 ms to minimize.
[2024-06-01 14:30:01] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 1 ms to minimize.
[2024-06-01 14:30:01] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 0 ms to minimize.
[2024-06-01 14:30:01] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:30:01] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 0 ms to minimize.
[2024-06-01 14:30:01] [INFO ] Deduced a trap composed of 265 places in 348 ms of which 3 ms to minimize.
[2024-06-01 14:30:02] [INFO ] Deduced a trap composed of 259 places in 397 ms of which 4 ms to minimize.
[2024-06-01 14:30:02] [INFO ] Deduced a trap composed of 232 places in 400 ms of which 3 ms to minimize.
[2024-06-01 14:30:03] [INFO ] Deduced a trap composed of 23 places in 344 ms of which 3 ms to minimize.
[2024-06-01 14:30:03] [INFO ] Deduced a trap composed of 284 places in 310 ms of which 3 ms to minimize.
[2024-06-01 14:30:03] [INFO ] Deduced a trap composed of 249 places in 320 ms of which 3 ms to minimize.
[2024-06-01 14:30:04] [INFO ] Deduced a trap composed of 259 places in 315 ms of which 2 ms to minimize.
[2024-06-01 14:30:04] [INFO ] Deduced a trap composed of 248 places in 329 ms of which 4 ms to minimize.
[2024-06-01 14:30:04] [INFO ] Deduced a trap composed of 46 places in 35 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 552/2540 variables, and 58 constraints, problems are : Problem set: 0 solved, 2020 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 29/32 constraints, State Equation: 0/556 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2020/2020 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2020 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2020 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/552 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 2020 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/552 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 2020 unsolved
[2024-06-01 14:30:09] [INFO ] Deduced a trap composed of 41 places in 195 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10)
(s1 0)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 1)
(s20 1)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 552/2540 variables, and 59 constraints, problems are : Problem set: 0 solved, 2020 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 29/32 constraints, State Equation: 0/556 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2020 constraints, Known Traps: 19/19 constraints]
After SMT, in 53792ms problems are : Problem set: 0 solved, 2020 unsolved
Search for dead transitions found 0 dead transitions in 53813ms
[2024-06-01 14:30:25] [INFO ] Flow matrix only has 1984 transitions (discarded 40 similar events)
[2024-06-01 14:30:25] [INFO ] Invariant cache hit.
[2024-06-01 14:30:26] [INFO ] Implicit Places using invariants in 473 ms returned []
[2024-06-01 14:30:26] [INFO ] Flow matrix only has 1984 transitions (discarded 40 similar events)
[2024-06-01 14:30:26] [INFO ] Invariant cache hit.
[2024-06-01 14:30:26] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 14:30:36] [INFO ] Implicit Places using invariants and state equation in 10479 ms returned []
Implicit Place search using SMT with State Equation took 10953 ms to find 0 implicit places.
[2024-06-01 14:30:36] [INFO ] Redundant transitions in 42 ms returned []
Running 2020 sub problems to find dead transitions.
[2024-06-01 14:30:36] [INFO ] Flow matrix only has 1984 transitions (discarded 40 similar events)
[2024-06-01 14:30:36] [INFO ] Invariant cache hit.
[2024-06-01 14:30:36] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2020 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/552 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 2020 unsolved
[2024-06-01 14:31:04] [INFO ] Deduced a trap composed of 46 places in 133 ms of which 2 ms to minimize.
[2024-06-01 14:31:04] [INFO ] Deduced a trap composed of 46 places in 109 ms of which 2 ms to minimize.
[2024-06-01 14:31:04] [INFO ] Deduced a trap composed of 46 places in 78 ms of which 2 ms to minimize.
[2024-06-01 14:31:04] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:31:04] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:31:04] [INFO ] Deduced a trap composed of 46 places in 29 ms of which 1 ms to minimize.
[2024-06-01 14:31:05] [INFO ] Deduced a trap composed of 46 places in 31 ms of which 0 ms to minimize.
[2024-06-01 14:31:05] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:31:05] [INFO ] Deduced a trap composed of 46 places in 33 ms of which 0 ms to minimize.
[2024-06-01 14:31:05] [INFO ] Deduced a trap composed of 259 places in 376 ms of which 3 ms to minimize.
[2024-06-01 14:31:06] [INFO ] Deduced a trap composed of 269 places in 365 ms of which 3 ms to minimize.
[2024-06-01 14:31:06] [INFO ] Deduced a trap composed of 226 places in 378 ms of which 3 ms to minimize.
[2024-06-01 14:31:06] [INFO ] Deduced a trap composed of 23 places in 439 ms of which 4 ms to minimize.
[2024-06-01 14:31:07] [INFO ] Deduced a trap composed of 241 places in 368 ms of which 3 ms to minimize.
[2024-06-01 14:31:07] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:31:10] [INFO ] Deduced a trap composed of 54 places in 403 ms of which 4 ms to minimize.
[2024-06-01 14:31:11] [INFO ] Deduced a trap composed of 89 places in 333 ms of which 3 ms to minimize.
[2024-06-01 14:31:14] [INFO ] Deduced a trap composed of 236 places in 407 ms of which 4 ms to minimize.
[2024-06-01 14:31:15] [INFO ] Deduced a trap composed of 210 places in 401 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 552/2540 variables, and 59 constraints, problems are : Problem set: 0 solved, 2020 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 29/32 constraints, State Equation: 0/556 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2020/2020 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2020 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2020 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/552 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 2020 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/552 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 2020 unsolved
[2024-06-01 14:31:25] [INFO ] Deduced a trap composed of 57 places in 204 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 552/2540 variables, and 60 constraints, problems are : Problem set: 0 solved, 2020 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 29/32 constraints, State Equation: 0/556 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2020 constraints, Known Traps: 20/20 constraints]
After SMT, in 73477ms problems are : Problem set: 0 solved, 2020 unsolved
Search for dead transitions found 0 dead transitions in 73500ms
Starting structural reductions in SI_LTL mode, iteration 1 : 556/856 places, 2024/2324 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 138417 ms. Remains : 556/856 places, 2024/2324 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J04T10-LTLFireability-14
Product exploration explored 100000 steps with 2808 reset in 624 ms.
Product exploration explored 100000 steps with 2801 reset in 492 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
RANDOM walk for 126 steps (0 resets) in 5 ms. (21 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
[2024-06-01 14:31:51] [INFO ] Flow matrix only has 1984 transitions (discarded 40 similar events)
[2024-06-01 14:31:51] [INFO ] Invariant cache hit.
[2024-06-01 14:31:52] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-06-01 14:31:52] [INFO ] [Real]Absence check using 12 positive and 32 generalized place invariants in 85 ms returned sat
[2024-06-01 14:31:53] [INFO ] [Real]Absence check using state equation in 1126 ms returned sat
[2024-06-01 14:31:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:31:54] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2024-06-01 14:31:54] [INFO ] [Nat]Absence check using 12 positive and 32 generalized place invariants in 89 ms returned sat
[2024-06-01 14:31:58] [INFO ] [Nat]Absence check using state equation in 3938 ms returned sat
[2024-06-01 14:31:58] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 14:32:00] [INFO ] [Nat]Added 200 Read/Feed constraints in 1519 ms returned sat
[2024-06-01 14:32:00] [INFO ] Deduced a trap composed of 46 places in 88 ms of which 2 ms to minimize.
[2024-06-01 14:32:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 777 ms
[2024-06-01 14:32:01] [INFO ] Computed and/alt/rep : 950/2766/920 causal constraints (skipped 1060 transitions) in 159 ms.
[2024-06-01 14:32:04] [INFO ] Added : 67 causal constraints over 14 iterations in 3400 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 11 out of 556 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 556/556 places, 2024/2024 transitions.
Applied a total of 0 rules in 50 ms. Remains 556 /556 variables (removed 0) and now considering 2024/2024 (removed 0) transitions.
Running 2020 sub problems to find dead transitions.
[2024-06-01 14:32:04] [INFO ] Flow matrix only has 1984 transitions (discarded 40 similar events)
[2024-06-01 14:32:04] [INFO ] Invariant cache hit.
[2024-06-01 14:32:04] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2020 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/552 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 2020 unsolved
[2024-06-01 14:32:32] [INFO ] Deduced a trap composed of 46 places in 100 ms of which 2 ms to minimize.
[2024-06-01 14:32:32] [INFO ] Deduced a trap composed of 46 places in 150 ms of which 1 ms to minimize.
[2024-06-01 14:32:32] [INFO ] Deduced a trap composed of 46 places in 91 ms of which 1 ms to minimize.
[2024-06-01 14:32:32] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:32:32] [INFO ] Deduced a trap composed of 46 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:32:32] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 1 ms to minimize.
[2024-06-01 14:32:33] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 1 ms to minimize.
[2024-06-01 14:32:33] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:32:33] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:32:33] [INFO ] Deduced a trap composed of 259 places in 412 ms of which 3 ms to minimize.
[2024-06-01 14:32:34] [INFO ] Deduced a trap composed of 269 places in 460 ms of which 4 ms to minimize.
[2024-06-01 14:32:34] [INFO ] Deduced a trap composed of 226 places in 376 ms of which 3 ms to minimize.
[2024-06-01 14:32:35] [INFO ] Deduced a trap composed of 23 places in 363 ms of which 3 ms to minimize.
[2024-06-01 14:32:35] [INFO ] Deduced a trap composed of 241 places in 374 ms of which 3 ms to minimize.
[2024-06-01 14:32:35] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 552/2540 variables, and 55 constraints, problems are : Problem set: 0 solved, 2020 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 29/32 constraints, State Equation: 0/556 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2020/2020 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2020 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2020 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/552 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 2020 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/552 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 2020 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 552/2540 variables, and 55 constraints, problems are : Problem set: 0 solved, 2020 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 29/32 constraints, State Equation: 0/556 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2020 constraints, Known Traps: 15/15 constraints]
After SMT, in 53077ms problems are : Problem set: 0 solved, 2020 unsolved
Search for dead transitions found 0 dead transitions in 53104ms
[2024-06-01 14:32:57] [INFO ] Flow matrix only has 1984 transitions (discarded 40 similar events)
[2024-06-01 14:32:57] [INFO ] Invariant cache hit.
[2024-06-01 14:32:58] [INFO ] Implicit Places using invariants in 484 ms returned []
[2024-06-01 14:32:58] [INFO ] Flow matrix only has 1984 transitions (discarded 40 similar events)
[2024-06-01 14:32:58] [INFO ] Invariant cache hit.
[2024-06-01 14:32:58] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 14:33:07] [INFO ] Implicit Places using invariants and state equation in 9151 ms returned []
Implicit Place search using SMT with State Equation took 9637 ms to find 0 implicit places.
[2024-06-01 14:33:07] [INFO ] Redundant transitions in 24 ms returned []
Running 2020 sub problems to find dead transitions.
[2024-06-01 14:33:07] [INFO ] Flow matrix only has 1984 transitions (discarded 40 similar events)
[2024-06-01 14:33:07] [INFO ] Invariant cache hit.
[2024-06-01 14:33:07] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2020 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/552 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 2020 unsolved
[2024-06-01 14:33:34] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 1 ms to minimize.
[2024-06-01 14:33:34] [INFO ] Deduced a trap composed of 46 places in 103 ms of which 2 ms to minimize.
[2024-06-01 14:33:34] [INFO ] Deduced a trap composed of 46 places in 76 ms of which 2 ms to minimize.
[2024-06-01 14:33:34] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:33:35] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:33:35] [INFO ] Deduced a trap composed of 46 places in 35 ms of which 0 ms to minimize.
[2024-06-01 14:33:35] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 0 ms to minimize.
[2024-06-01 14:33:35] [INFO ] Deduced a trap composed of 46 places in 35 ms of which 1 ms to minimize.
[2024-06-01 14:33:35] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 1 ms to minimize.
[2024-06-01 14:33:35] [INFO ] Deduced a trap composed of 259 places in 418 ms of which 4 ms to minimize.
[2024-06-01 14:33:36] [INFO ] Deduced a trap composed of 269 places in 390 ms of which 4 ms to minimize.
[2024-06-01 14:33:36] [INFO ] Deduced a trap composed of 226 places in 340 ms of which 3 ms to minimize.
[2024-06-01 14:33:36] [INFO ] Deduced a trap composed of 23 places in 321 ms of which 3 ms to minimize.
[2024-06-01 14:33:37] [INFO ] Deduced a trap composed of 241 places in 397 ms of which 3 ms to minimize.
[2024-06-01 14:33:37] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:33:40] [INFO ] Deduced a trap composed of 54 places in 371 ms of which 4 ms to minimize.
[2024-06-01 14:33:40] [INFO ] Deduced a trap composed of 89 places in 335 ms of which 4 ms to minimize.
[2024-06-01 14:33:43] [INFO ] Deduced a trap composed of 236 places in 335 ms of which 3 ms to minimize.
[2024-06-01 14:33:43] [INFO ] Deduced a trap composed of 210 places in 374 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 552/2540 variables, and 59 constraints, problems are : Problem set: 0 solved, 2020 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 29/32 constraints, State Equation: 0/556 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2020/2020 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2020 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2020 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/552 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 2020 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/552 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 2020 unsolved
[2024-06-01 14:33:56] [INFO ] Deduced a trap composed of 57 places in 236 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 552/2540 variables, and 60 constraints, problems are : Problem set: 0 solved, 2020 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 29/32 constraints, State Equation: 0/556 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2020 constraints, Known Traps: 20/20 constraints]
After SMT, in 72921ms problems are : Problem set: 0 solved, 2020 unsolved
Search for dead transitions found 0 dead transitions in 72939ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 135769 ms. Remains : 556/556 places, 2024/2024 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 52 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
RANDOM walk for 113 steps (0 resets) in 7 ms. (14 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 64 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
[2024-06-01 14:34:20] [INFO ] Flow matrix only has 1984 transitions (discarded 40 similar events)
[2024-06-01 14:34:20] [INFO ] Invariant cache hit.
[2024-06-01 14:34:21] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-06-01 14:34:21] [INFO ] [Real]Absence check using 12 positive and 32 generalized place invariants in 97 ms returned sat
[2024-06-01 14:34:22] [INFO ] [Real]Absence check using state equation in 1172 ms returned sat
[2024-06-01 14:34:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:34:23] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-06-01 14:34:23] [INFO ] [Nat]Absence check using 12 positive and 32 generalized place invariants in 74 ms returned sat
[2024-06-01 14:34:27] [INFO ] [Nat]Absence check using state equation in 4344 ms returned sat
[2024-06-01 14:34:27] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 14:34:29] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 14:34:29] [INFO ] [Nat]Added 200 Read/Feed constraints in 1684 ms returned sat
[2024-06-01 14:34:29] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:34:30] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 2 ms to minimize.
[2024-06-01 14:34:30] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 1 ms to minimize.
[2024-06-01 14:34:31] [INFO ] Trap strengthening (SAT) tested/added 3/3 trap constraints in 2413 ms
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2798 reset in 660 ms.
Product exploration explored 100000 steps with 2820 reset in 521 ms.
Support contains 11 out of 556 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 556/556 places, 2024/2024 transitions.
Applied a total of 0 rules in 25 ms. Remains 556 /556 variables (removed 0) and now considering 2024/2024 (removed 0) transitions.
Running 2020 sub problems to find dead transitions.
[2024-06-01 14:34:33] [INFO ] Flow matrix only has 1984 transitions (discarded 40 similar events)
[2024-06-01 14:34:33] [INFO ] Invariant cache hit.
[2024-06-01 14:34:33] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2020 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/552 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 2020 unsolved
[2024-06-01 14:34:59] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 2 ms to minimize.
[2024-06-01 14:34:59] [INFO ] Deduced a trap composed of 46 places in 83 ms of which 1 ms to minimize.
[2024-06-01 14:34:59] [INFO ] Deduced a trap composed of 46 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:34:59] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:34:59] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:34:59] [INFO ] Deduced a trap composed of 46 places in 30 ms of which 0 ms to minimize.
[2024-06-01 14:34:59] [INFO ] Deduced a trap composed of 46 places in 31 ms of which 0 ms to minimize.
[2024-06-01 14:34:59] [INFO ] Deduced a trap composed of 46 places in 30 ms of which 1 ms to minimize.
[2024-06-01 14:34:59] [INFO ] Deduced a trap composed of 46 places in 31 ms of which 0 ms to minimize.
[2024-06-01 14:35:00] [INFO ] Deduced a trap composed of 259 places in 349 ms of which 3 ms to minimize.
[2024-06-01 14:35:00] [INFO ] Deduced a trap composed of 269 places in 322 ms of which 3 ms to minimize.
[2024-06-01 14:35:01] [INFO ] Deduced a trap composed of 226 places in 329 ms of which 3 ms to minimize.
[2024-06-01 14:35:01] [INFO ] Deduced a trap composed of 23 places in 312 ms of which 2 ms to minimize.
[2024-06-01 14:35:01] [INFO ] Deduced a trap composed of 241 places in 324 ms of which 3 ms to minimize.
[2024-06-01 14:35:01] [INFO ] Deduced a trap composed of 46 places in 32 ms of which 0 ms to minimize.
[2024-06-01 14:35:04] [INFO ] Deduced a trap composed of 54 places in 318 ms of which 3 ms to minimize.
[2024-06-01 14:35:04] [INFO ] Deduced a trap composed of 89 places in 343 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 552/2540 variables, and 57 constraints, problems are : Problem set: 0 solved, 2020 unsolved in 20061 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 29/32 constraints, State Equation: 0/556 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2020/2020 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2020 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2020 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/552 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 2020 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/552 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 2020 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 10)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 1)
(s14 0)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 552/2540 variables, and 57 constraints, problems are : Problem set: 0 solved, 2020 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 29/32 constraints, State Equation: 0/556 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2020 constraints, Known Traps: 17/17 constraints]
After SMT, in 53303ms problems are : Problem set: 0 solved, 2020 unsolved
Search for dead transitions found 0 dead transitions in 53322ms
[2024-06-01 14:35:26] [INFO ] Flow matrix only has 1984 transitions (discarded 40 similar events)
[2024-06-01 14:35:26] [INFO ] Invariant cache hit.
[2024-06-01 14:35:27] [INFO ] Implicit Places using invariants in 543 ms returned []
[2024-06-01 14:35:27] [INFO ] Flow matrix only has 1984 transitions (discarded 40 similar events)
[2024-06-01 14:35:27] [INFO ] Invariant cache hit.
[2024-06-01 14:35:27] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 14:35:35] [INFO ] Implicit Places using invariants and state equation in 8312 ms returned []
Implicit Place search using SMT with State Equation took 8855 ms to find 0 implicit places.
[2024-06-01 14:35:35] [INFO ] Redundant transitions in 27 ms returned []
Running 2020 sub problems to find dead transitions.
[2024-06-01 14:35:35] [INFO ] Flow matrix only has 1984 transitions (discarded 40 similar events)
[2024-06-01 14:35:35] [INFO ] Invariant cache hit.
[2024-06-01 14:35:35] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2020 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/552 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 2020 unsolved
[2024-06-01 14:36:03] [INFO ] Deduced a trap composed of 46 places in 105 ms of which 2 ms to minimize.
[2024-06-01 14:36:03] [INFO ] Deduced a trap composed of 46 places in 109 ms of which 2 ms to minimize.
[2024-06-01 14:36:03] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 1 ms to minimize.
[2024-06-01 14:36:03] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:36:03] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:36:03] [INFO ] Deduced a trap composed of 46 places in 33 ms of which 0 ms to minimize.
[2024-06-01 14:36:03] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 0 ms to minimize.
[2024-06-01 14:36:03] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:36:03] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 1 ms to minimize.
[2024-06-01 14:36:04] [INFO ] Deduced a trap composed of 259 places in 371 ms of which 3 ms to minimize.
[2024-06-01 14:36:04] [INFO ] Deduced a trap composed of 269 places in 384 ms of which 4 ms to minimize.
[2024-06-01 14:36:04] [INFO ] Deduced a trap composed of 226 places in 377 ms of which 3 ms to minimize.
[2024-06-01 14:36:05] [INFO ] Deduced a trap composed of 23 places in 320 ms of which 2 ms to minimize.
[2024-06-01 14:36:05] [INFO ] Deduced a trap composed of 241 places in 321 ms of which 3 ms to minimize.
[2024-06-01 14:36:05] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:36:08] [INFO ] Deduced a trap composed of 54 places in 308 ms of which 3 ms to minimize.
[2024-06-01 14:36:08] [INFO ] Deduced a trap composed of 89 places in 313 ms of which 3 ms to minimize.
[2024-06-01 14:36:12] [INFO ] Deduced a trap composed of 236 places in 316 ms of which 3 ms to minimize.
[2024-06-01 14:36:13] [INFO ] Deduced a trap composed of 210 places in 306 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 552/2540 variables, and 59 constraints, problems are : Problem set: 0 solved, 2020 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 29/32 constraints, State Equation: 0/556 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2020/2020 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2020 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2020 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/552 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 2020 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/552 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 2020 unsolved
[2024-06-01 14:36:23] [INFO ] Deduced a trap composed of 57 places in 246 ms of which 2 ms to minimize.
[2024-06-01 14:36:48] [INFO ] Deduced a trap composed of 306 places in 295 ms of which 3 ms to minimize.
[2024-06-01 14:36:48] [INFO ] Deduced a trap composed of 196 places in 284 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 552/2540 variables, and 62 constraints, problems are : Problem set: 0 solved, 2020 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 29/32 constraints, State Equation: 0/556 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2020 constraints, Known Traps: 22/22 constraints]
After SMT, in 73223ms problems are : Problem set: 0 solved, 2020 unsolved
Search for dead transitions found 0 dead transitions in 73242ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 135484 ms. Remains : 556/556 places, 2024/2024 transitions.
Treatment of property PolyORBLF-COL-S04J04T10-LTLFireability-14 finished in 436929 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((p0 U p1))&&X(F(p2)))))'
Support contains 93 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 34 ms. Remains 836 /856 variables (removed 20) and now considering 2304/2324 (removed 20) transitions.
Running 2300 sub problems to find dead transitions.
[2024-06-01 14:36:48] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
// Phase 1: matrix 2264 rows 836 cols
[2024-06-01 14:36:48] [INFO ] Computed 44 invariants in 32 ms
[2024-06-01 14:36:48] [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 33135ms, After SMT, problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 33156ms
[2024-06-01 14:37:21] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-06-01 14:37:21] [INFO ] Invariant cache hit.
[2024-06-01 14:37:22] [INFO ] Implicit Places using invariants in 488 ms returned []
[2024-06-01 14:37:22] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-06-01 14:37:22] [INFO ] Invariant cache hit.
[2024-06-01 14:37:23] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 14:37:39] [INFO ] Implicit Places using invariants and state equation in 17231 ms returned []
Implicit Place search using SMT with State Equation took 17720 ms to find 0 implicit places.
Running 2300 sub problems to find dead transitions.
[2024-06-01 14:37:39] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-06-01 14:37:39] [INFO ] Invariant cache hit.
[2024-06-01 14:37:39] [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-06-01 14:38:16] [INFO ] Deduced a trap composed of 74 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:38:16] [INFO ] Deduced a trap composed of 74 places in 42 ms of which 1 ms to minimize.
[2024-06-01 14:38:16] [INFO ] Deduced a trap composed of 74 places in 41 ms of which 1 ms to minimize.
[2024-06-01 14:38:16] [INFO ] Deduced a trap composed of 74 places in 40 ms of which 0 ms to minimize.
[2024-06-01 14:38:16] [INFO ] Deduced a trap composed of 74 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:38:17] [INFO ] Deduced a trap composed of 74 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:38:17] [INFO ] Deduced a trap composed of 74 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:38:17] [INFO ] Deduced a trap composed of 74 places in 44 ms of which 0 ms to minimize.
[2024-06-01 14:38:17] [INFO ] Deduced a trap composed of 74 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:38:18] [INFO ] Deduced a trap composed of 489 places in 435 ms of which 6 ms to minimize.
[2024-06-01 14:38:18] [INFO ] Deduced a trap composed of 511 places in 437 ms of which 6 ms to minimize.
[2024-06-01 14:38:19] [INFO ] Deduced a trap composed of 223 places in 423 ms of which 4 ms to minimize.
[2024-06-01 14:38:19] [INFO ] Deduced a trap composed of 74 places in 68 ms of which 1 ms to minimize.
[2024-06-01 14:38:22] [INFO ] Deduced a trap composed of 99 places in 331 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 832/3100 variables, and 45 constraints, problems are : Problem set: 0 solved, 2300 unsolved in 30051 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: 14/14 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, 14/45 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
[2024-06-01 14:38:26] [INFO ] Deduced a trap composed of 3 places in 348 ms of which 4 ms to minimize.
[2024-06-01 14:38:27] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 1 ms to minimize.
[2024-06-01 14:38:30] [INFO ] Deduced a trap composed of 499 places in 530 ms of which 6 ms to minimize.
[2024-06-01 14:38:33] [INFO ] Deduced a trap composed of 508 places in 497 ms of which 6 ms to minimize.
[2024-06-01 14:38:34] [INFO ] Deduced a trap composed of 517 places in 459 ms of which 4 ms to minimize.
[2024-06-01 14:38:34] [INFO ] Deduced a trap composed of 502 places in 406 ms of which 4 ms to minimize.
[2024-06-01 14:38:35] [INFO ] Deduced a trap composed of 522 places in 375 ms of which 4 ms to minimize.
[2024-06-01 14:38:35] [INFO ] Deduced a trap composed of 5 places in 180 ms of which 4 ms to minimize.
[2024-06-01 14:38:35] [INFO ] Deduced a trap composed of 5 places in 185 ms of which 3 ms to minimize.
[2024-06-01 14:38:35] [INFO ] Deduced a trap composed of 23 places in 180 ms of which 2 ms to minimize.
[2024-06-01 14:38:35] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 0 ms to minimize.
[2024-06-01 14:38:39] [INFO ] Deduced a trap composed of 505 places in 576 ms of which 5 ms to minimize.
[2024-06-01 14:38:39] [INFO ] Deduced a trap composed of 496 places in 470 ms of which 5 ms to minimize.
[2024-06-01 14:38:40] [INFO ] Deduced a trap composed of 503 places in 430 ms of which 4 ms to minimize.
[2024-06-01 14:38:41] [INFO ] Deduced a trap composed of 540 places in 399 ms of which 4 ms to minimize.
[2024-06-01 14:38:43] [INFO ] Deduced a trap composed of 540 places in 416 ms of which 4 ms to minimize.
[2024-06-01 14:38:48] [INFO ] Deduced a trap composed of 615 places in 476 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 832/3100 variables, and 62 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: 0/2300 constraints, Known Traps: 31/31 constraints]
After SMT, in 73250ms problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 73268ms
Starting structural reductions in LTL mode, iteration 1 : 836/856 places, 2304/2324 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 124185 ms. Remains : 836/856 places, 2304/2324 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p2)]
Running random walk in product with property : PolyORBLF-COL-S04J04T10-LTLFireability-15
Stuttering criterion allowed to conclude after 80664 steps with 889 reset in 967 ms.
FORMULA PolyORBLF-COL-S04J04T10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S04J04T10-LTLFireability-15 finished in 125358 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)))))))'
Found a Shortening insensitive property : PolyORBLF-COL-S04J04T10-LTLFireability-01
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
Support contains 68 out of 856 places. Attempting structural reductions.
Starting structural reductions in LI_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 1 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 1 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 85 ms. Remains 596 /856 variables (removed 260) and now considering 2064/2324 (removed 260) transitions.
Running 2060 sub problems to find dead transitions.
[2024-06-01 14:38:54] [INFO ] Flow matrix only has 2024 transitions (discarded 40 similar events)
// Phase 1: matrix 2024 rows 596 cols
[2024-06-01 14:38:54] [INFO ] Computed 44 invariants in 48 ms
[2024-06-01 14:38:54] [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-06-01 14:39:22] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:39:23] [INFO ] Deduced a trap composed of 50 places in 70 ms of which 1 ms to minimize.
[2024-06-01 14:39:23] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2024-06-01 14:39:23] [INFO ] Deduced a trap composed of 50 places in 37 ms of which 0 ms to minimize.
[2024-06-01 14:39:23] [INFO ] Deduced a trap composed of 50 places in 36 ms of which 1 ms to minimize.
[2024-06-01 14:39:23] [INFO ] Deduced a trap composed of 50 places in 38 ms of which 1 ms to minimize.
[2024-06-01 14:39:23] [INFO ] Deduced a trap composed of 50 places in 39 ms of which 0 ms to minimize.
[2024-06-01 14:39:23] [INFO ] Deduced a trap composed of 50 places in 35 ms of which 0 ms to minimize.
[2024-06-01 14:39:23] [INFO ] Deduced a trap composed of 50 places in 31 ms of which 1 ms to minimize.
[2024-06-01 14:39:24] [INFO ] Deduced a trap composed of 305 places in 419 ms of which 4 ms to minimize.
[2024-06-01 14:39:25] [INFO ] Deduced a trap composed of 294 places in 398 ms of which 3 ms to minimize.
[2024-06-01 14:39:25] [INFO ] Deduced a trap composed of 281 places in 409 ms of which 4 ms to minimize.
[2024-06-01 14:39:26] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 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 20047 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-06-01 14:39:32] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
[2024-06-01 14:39:39] [INFO ] Deduced a trap composed of 290 places in 381 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 592/2620 variables, and 55 constraints, problems are : Problem set: 0 solved, 2060 unsolved in 20043 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: 15/15 constraints]
After SMT, in 53036ms problems are : Problem set: 0 solved, 2060 unsolved
Search for dead transitions found 0 dead transitions in 53058ms
[2024-06-01 14:39:47] [INFO ] Flow matrix only has 2024 transitions (discarded 40 similar events)
[2024-06-01 14:39:47] [INFO ] Invariant cache hit.
[2024-06-01 14:39:48] [INFO ] Implicit Places using invariants in 581 ms returned []
[2024-06-01 14:39:48] [INFO ] Flow matrix only has 2024 transitions (discarded 40 similar events)
[2024-06-01 14:39:48] [INFO ] Invariant cache hit.
[2024-06-01 14:39:48] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 14:39:58] [INFO ] Implicit Places using invariants and state equation in 10533 ms returned []
Implicit Place search using SMT with State Equation took 11116 ms to find 0 implicit places.
Running 2060 sub problems to find dead transitions.
[2024-06-01 14:39:58] [INFO ] Flow matrix only has 2024 transitions (discarded 40 similar events)
[2024-06-01 14:39:58] [INFO ] Invariant cache hit.
[2024-06-01 14:39:58] [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-06-01 14:40:26] [INFO ] Deduced a trap composed of 50 places in 108 ms of which 2 ms to minimize.
[2024-06-01 14:40:26] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 1 ms to minimize.
[2024-06-01 14:40:27] [INFO ] Deduced a trap composed of 50 places in 64 ms of which 1 ms to minimize.
[2024-06-01 14:40:27] [INFO ] Deduced a trap composed of 50 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:40:27] [INFO ] Deduced a trap composed of 50 places in 28 ms of which 1 ms to minimize.
[2024-06-01 14:40:27] [INFO ] Deduced a trap composed of 50 places in 33 ms of which 1 ms to minimize.
[2024-06-01 14:40:27] [INFO ] Deduced a trap composed of 50 places in 31 ms of which 1 ms to minimize.
[2024-06-01 14:40:27] [INFO ] Deduced a trap composed of 50 places in 37 ms of which 0 ms to minimize.
[2024-06-01 14:40:27] [INFO ] Deduced a trap composed of 50 places in 32 ms of which 1 ms to minimize.
[2024-06-01 14:40:28] [INFO ] Deduced a trap composed of 280 places in 318 ms of which 3 ms to minimize.
[2024-06-01 14:40:28] [INFO ] Deduced a trap composed of 300 places in 317 ms of which 3 ms to minimize.
[2024-06-01 14:40:31] [INFO ] Deduced a trap composed of 50 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:40:34] [INFO ] Deduced a trap composed of 290 places in 370 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 30041 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-06-01 14:40:54] [INFO ] Deduced a trap composed of 23 places in 160 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 592/2620 variables, and 54 constraints, problems are : Problem set: 0 solved, 2060 unsolved in 30033 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 73638ms problems are : Problem set: 0 solved, 2060 unsolved
Search for dead transitions found 0 dead transitions in 73659ms
Starting structural reductions in LI_LTL mode, iteration 1 : 596/856 places, 2064/2324 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 137926 ms. Remains : 596/856 places, 2064/2324 transitions.
Running random walk in product with property : PolyORBLF-COL-S04J04T10-LTLFireability-01
Product exploration explored 100000 steps with 1755 reset in 1166 ms.
Product exploration explored 100000 steps with 1632 reset in 953 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 162 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 170 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
RANDOM walk for 40000 steps (10 resets) in 559 ms. (71 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 450 ms. (88 steps per ms) remains 1/1 properties
[2024-06-01 14:41:15] [INFO ] Flow matrix only has 2024 transitions (discarded 40 similar events)
[2024-06-01 14:41:15] [INFO ] Invariant cache hit.
[2024-06-01 14:41:15] [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) 78/136 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/151 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 425/576 variables, 22/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/579 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf3 is UNSAT
After SMT solving in domain Real declared 594/2620 variables, and 43 constraints, problems are : Problem set: 1 solved, 0 unsolved in 233 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 0/596 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 321ms 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 259 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 130 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
Support contains 68 out of 596 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 2064/2064 transitions.
Applied a total of 0 rules in 9 ms. Remains 596 /596 variables (removed 0) and now considering 2064/2064 (removed 0) transitions.
Running 2060 sub problems to find dead transitions.
[2024-06-01 14:41:15] [INFO ] Flow matrix only has 2024 transitions (discarded 40 similar events)
[2024-06-01 14:41:15] [INFO ] Invariant cache hit.
[2024-06-01 14:41:15] [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-06-01 14:41:42] [INFO ] Deduced a trap composed of 50 places in 95 ms of which 1 ms to minimize.
[2024-06-01 14:41:42] [INFO ] Deduced a trap composed of 50 places in 114 ms of which 2 ms to minimize.
[2024-06-01 14:41:42] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 1 ms to minimize.
[2024-06-01 14:41:42] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:41:42] [INFO ] Deduced a trap composed of 50 places in 38 ms of which 1 ms to minimize.
[2024-06-01 14:41:43] [INFO ] Deduced a trap composed of 50 places in 36 ms of which 1 ms to minimize.
[2024-06-01 14:41:43] [INFO ] Deduced a trap composed of 50 places in 43 ms of which 0 ms to minimize.
[2024-06-01 14:41:43] [INFO ] Deduced a trap composed of 50 places in 37 ms of which 0 ms to minimize.
[2024-06-01 14:41:43] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:41:44] [INFO ] Deduced a trap composed of 280 places in 322 ms of which 3 ms to minimize.
[2024-06-01 14:41:44] [INFO ] Deduced a trap composed of 300 places in 321 ms of which 3 ms to minimize.
[2024-06-01 14:41:47] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2620 variables, and 52 constraints, problems are : Problem set: 0 solved, 2060 unsolved in 20031 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: 12/12 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, 12/52 constraints. Problems are: Problem set: 0 solved, 2060 unsolved
[2024-06-01 14:41:52] [INFO ] Deduced a trap composed of 41 places in 209 ms of which 2 ms to minimize.
[2024-06-01 14:42:04] [INFO ] Deduced a trap composed of 24 places in 218 ms of which 3 ms to minimize.
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 20029 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 53197ms problems are : Problem set: 0 solved, 2060 unsolved
Search for dead transitions found 0 dead transitions in 53219ms
[2024-06-01 14:42:09] [INFO ] Flow matrix only has 2024 transitions (discarded 40 similar events)
[2024-06-01 14:42:09] [INFO ] Invariant cache hit.
[2024-06-01 14:42:09] [INFO ] Implicit Places using invariants in 547 ms returned []
[2024-06-01 14:42:09] [INFO ] Flow matrix only has 2024 transitions (discarded 40 similar events)
[2024-06-01 14:42:09] [INFO ] Invariant cache hit.
[2024-06-01 14:42:10] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 14:42:21] [INFO ] Implicit Places using invariants and state equation in 11506 ms returned []
Implicit Place search using SMT with State Equation took 12057 ms to find 0 implicit places.
Running 2060 sub problems to find dead transitions.
[2024-06-01 14:42:21] [INFO ] Flow matrix only has 2024 transitions (discarded 40 similar events)
[2024-06-01 14:42:21] [INFO ] Invariant cache hit.
[2024-06-01 14:42:21] [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-06-01 14:42:52] [INFO ] Deduced a trap composed of 50 places in 173 ms of which 2 ms to minimize.
[2024-06-01 14:42:52] [INFO ] Deduced a trap composed of 50 places in 146 ms of which 2 ms to minimize.
[2024-06-01 14:42:52] [INFO ] Deduced a trap composed of 50 places in 99 ms of which 1 ms to minimize.
[2024-06-01 14:42:52] [INFO ] Deduced a trap composed of 50 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:42:52] [INFO ] Deduced a trap composed of 50 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:42:52] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2024-06-01 14:42:52] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:42:53] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:42:53] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:42:54] [INFO ] Deduced a trap composed of 280 places in 464 ms of which 4 ms to minimize.
[2024-06-01 14:42:54] [INFO ] Deduced a trap composed of 300 places in 431 ms of which 4 ms to minimize.
[2024-06-01 14:42:57] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:42:59] [INFO ] Deduced a trap composed of 290 places in 472 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 30031 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-06-01 14:43:20] [INFO ] Deduced a trap composed of 23 places in 192 ms of which 3 ms to minimize.
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 30038 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 76327ms problems are : Problem set: 0 solved, 2060 unsolved
Search for dead transitions found 0 dead transitions in 76349ms
Finished structural reductions in LTL mode , in 1 iterations and 141642 ms. Remains : 596/596 places, 2064/2064 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 133 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 127 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
RANDOM walk for 490 steps (0 resets) in 12 ms. (37 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 315 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 161 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
Product exploration explored 100000 steps with 1693 reset in 1001 ms.
Product exploration explored 100000 steps with 1701 reset in 773 ms.
Applying partial POR strategy [false, true, false, false]
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
Support contains 68 out of 596 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 596/596 places, 2064/2064 transitions.
Applied a total of 0 rules in 42 ms. Remains 596 /596 variables (removed 0) and now considering 2064/2064 (removed 0) transitions.
Running 2060 sub problems to find dead transitions.
[2024-06-01 14:43:40] [INFO ] Flow matrix only has 2024 transitions (discarded 40 similar events)
[2024-06-01 14:43:40] [INFO ] Invariant cache hit.
[2024-06-01 14:43:40] [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-06-01 14:44:08] [INFO ] Deduced a trap composed of 50 places in 146 ms of which 2 ms to minimize.
[2024-06-01 14:44:09] [INFO ] Deduced a trap composed of 50 places in 105 ms of which 2 ms to minimize.
[2024-06-01 14:44:09] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 1 ms to minimize.
[2024-06-01 14:44:09] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2024-06-01 14:44:09] [INFO ] Deduced a trap composed of 50 places in 36 ms of which 1 ms to minimize.
[2024-06-01 14:44:09] [INFO ] Deduced a trap composed of 50 places in 37 ms of which 1 ms to minimize.
[2024-06-01 14:44:09] [INFO ] Deduced a trap composed of 50 places in 34 ms of which 1 ms to minimize.
[2024-06-01 14:44:09] [INFO ] Deduced a trap composed of 50 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:44:09] [INFO ] Deduced a trap composed of 50 places in 39 ms of which 0 ms to minimize.
[2024-06-01 14:44:10] [INFO ] Deduced a trap composed of 280 places in 482 ms of which 4 ms to minimize.
[2024-06-01 14:44:11] [INFO ] Deduced a trap composed of 300 places in 402 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2620 variables, and 51 constraints, problems are : Problem set: 0 solved, 2060 unsolved in 20034 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: 11/11 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, 11/51 constraints. Problems are: Problem set: 0 solved, 2060 unsolved
[2024-06-01 14:44:17] [INFO ] Deduced a trap composed of 50 places in 37 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 592/2620 variables, and 52 constraints, problems are : Problem set: 0 solved, 2060 unsolved in 20033 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: 12/12 constraints]
After SMT, in 53109ms problems are : Problem set: 0 solved, 2060 unsolved
Search for dead transitions found 0 dead transitions in 53134ms
[2024-06-01 14:44:33] [INFO ] Redundant transitions in 28 ms returned []
Running 2060 sub problems to find dead transitions.
[2024-06-01 14:44:33] [INFO ] Flow matrix only has 2024 transitions (discarded 40 similar events)
[2024-06-01 14:44:33] [INFO ] Invariant cache hit.
[2024-06-01 14:44:33] [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-06-01 14:45:02] [INFO ] Deduced a trap composed of 50 places in 106 ms of which 1 ms to minimize.
[2024-06-01 14:45:02] [INFO ] Deduced a trap composed of 50 places in 120 ms of which 2 ms to minimize.
[2024-06-01 14:45:02] [INFO ] Deduced a trap composed of 50 places in 70 ms of which 1 ms to minimize.
[2024-06-01 14:45:02] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:45:02] [INFO ] Deduced a trap composed of 50 places in 33 ms of which 1 ms to minimize.
[2024-06-01 14:45:02] [INFO ] Deduced a trap composed of 50 places in 32 ms of which 0 ms to minimize.
[2024-06-01 14:45:02] [INFO ] Deduced a trap composed of 50 places in 36 ms of which 1 ms to minimize.
[2024-06-01 14:45:02] [INFO ] Deduced a trap composed of 50 places in 32 ms of which 1 ms to minimize.
[2024-06-01 14:45:02] [INFO ] Deduced a trap composed of 50 places in 37 ms of which 0 ms to minimize.
[2024-06-01 14:45:03] [INFO ] Deduced a trap composed of 280 places in 485 ms of which 4 ms to minimize.
[2024-06-01 14:45:04] [INFO ] Deduced a trap composed of 300 places in 426 ms of which 3 ms to minimize.
[2024-06-01 14:45:07] [INFO ] Deduced a trap composed of 50 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:45:10] [INFO ] Deduced a trap composed of 290 places in 453 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 30031 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-06-01 14:45:31] [INFO ] Deduced a trap composed of 23 places in 189 ms of which 3 ms to minimize.
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 30048 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 72985ms problems are : Problem set: 0 solved, 2060 unsolved
Search for dead transitions found 0 dead transitions in 73005ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 126220 ms. Remains : 596/596 places, 2064/2064 transitions.
Support contains 68 out of 596 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 2064/2064 transitions.
Applied a total of 0 rules in 11 ms. Remains 596 /596 variables (removed 0) and now considering 2064/2064 (removed 0) transitions.
Running 2060 sub problems to find dead transitions.
[2024-06-01 14:45:46] [INFO ] Flow matrix only has 2024 transitions (discarded 40 similar events)
[2024-06-01 14:45:46] [INFO ] Invariant cache hit.
[2024-06-01 14:45:46] [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-06-01 14:46:17] [INFO ] Deduced a trap composed of 50 places in 142 ms of which 2 ms to minimize.
[2024-06-01 14:46:17] [INFO ] Deduced a trap composed of 50 places in 123 ms of which 1 ms to minimize.
[2024-06-01 14:46:17] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 2 ms to minimize.
[2024-06-01 14:46:17] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:46:17] [INFO ] Deduced a trap composed of 50 places in 37 ms of which 0 ms to minimize.
[2024-06-01 14:46:17] [INFO ] Deduced a trap composed of 50 places in 35 ms of which 1 ms to minimize.
[2024-06-01 14:46:17] [INFO ] Deduced a trap composed of 50 places in 37 ms of which 1 ms to minimize.
[2024-06-01 14:46:18] [INFO ] Deduced a trap composed of 50 places in 31 ms of which 1 ms to minimize.
[2024-06-01 14:46:18] [INFO ] Deduced a trap composed of 50 places in 41 ms of which 0 ms to minimize.
[2024-06-01 14:46:19] [INFO ] Deduced a trap composed of 280 places in 402 ms of which 4 ms to minimize.
[2024-06-01 14:46:19] [INFO ] Deduced a trap composed of 300 places in 386 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 9.0)
(s1 1.0)
(s2 0.0)
(s3 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 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.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 1.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 1.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 0.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 9.0)
(s173 0.0)
(s174 1.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 1.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 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 1.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 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 1.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 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 0.0)
(s388 1.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 4.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.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 1.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2620 variables, and 51 constraints, problems are : Problem set: 0 solved, 2060 unsolved in 20036 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: 11/11 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, 11/51 constraints. Problems are: Problem set: 0 solved, 2060 unsolved
[2024-06-01 14:46:24] [INFO ] Deduced a trap composed of 50 places in 43 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 592/2620 variables, and 52 constraints, problems are : Problem set: 0 solved, 2060 unsolved in 20037 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: 12/12 constraints]
After SMT, in 53772ms problems are : Problem set: 0 solved, 2060 unsolved
Search for dead transitions found 0 dead transitions in 53797ms
[2024-06-01 14:46:40] [INFO ] Flow matrix only has 2024 transitions (discarded 40 similar events)
[2024-06-01 14:46:40] [INFO ] Invariant cache hit.
[2024-06-01 14:46:41] [INFO ] Implicit Places using invariants in 456 ms returned []
[2024-06-01 14:46:41] [INFO ] Flow matrix only has 2024 transitions (discarded 40 similar events)
[2024-06-01 14:46:41] [INFO ] Invariant cache hit.
[2024-06-01 14:46:41] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 14:46:51] [INFO ] Implicit Places using invariants and state equation in 10629 ms returned []
Implicit Place search using SMT with State Equation took 11087 ms to find 0 implicit places.
Running 2060 sub problems to find dead transitions.
[2024-06-01 14:46:51] [INFO ] Flow matrix only has 2024 transitions (discarded 40 similar events)
[2024-06-01 14:46:51] [INFO ] Invariant cache hit.
[2024-06-01 14:46:51] [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-06-01 14:47:21] [INFO ] Deduced a trap composed of 50 places in 141 ms of which 2 ms to minimize.
[2024-06-01 14:47:21] [INFO ] Deduced a trap composed of 50 places in 128 ms of which 2 ms to minimize.
[2024-06-01 14:47:21] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 1 ms to minimize.
[2024-06-01 14:47:21] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:47:21] [INFO ] Deduced a trap composed of 50 places in 37 ms of which 1 ms to minimize.
[2024-06-01 14:47:21] [INFO ] Deduced a trap composed of 50 places in 38 ms of which 1 ms to minimize.
[2024-06-01 14:47:21] [INFO ] Deduced a trap composed of 50 places in 36 ms of which 1 ms to minimize.
[2024-06-01 14:47:22] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:47:22] [INFO ] Deduced a trap composed of 50 places in 45 ms of which 0 ms to minimize.
[2024-06-01 14:47:23] [INFO ] Deduced a trap composed of 280 places in 455 ms of which 4 ms to minimize.
[2024-06-01 14:47:24] [INFO ] Deduced a trap composed of 300 places in 443 ms of which 4 ms to minimize.
[2024-06-01 14:47:27] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:47:29] [INFO ] Deduced a trap composed of 290 places in 357 ms of which 3 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 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: 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-06-01 14:47:47] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 5)
(s1 5)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 1)
(s7 0)
(s8 0)
(s9 1)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 30024 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 73024ms problems are : Problem set: 0 solved, 2060 unsolved
Search for dead transitions found 0 dead transitions in 73043ms
Finished structural reductions in LTL mode , in 1 iterations and 137947 ms. Remains : 596/596 places, 2064/2064 transitions.
Treatment of property PolyORBLF-COL-S04J04T10-LTLFireability-01 finished in 550899 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)))'
Found a Shortening insensitive property : PolyORBLF-COL-S04J04T10-LTLFireability-02
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 61 out of 856 places. Attempting structural reductions.
Starting structural reductions in LI_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 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 0 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 560 place count 576 transition count 2044
Applied a total of 560 rules in 76 ms. Remains 576 /856 variables (removed 280) and now considering 2044/2324 (removed 280) transitions.
Running 2040 sub problems to find dead transitions.
[2024-06-01 14:48:05] [INFO ] Flow matrix only has 2004 transitions (discarded 40 similar events)
// Phase 1: matrix 2004 rows 576 cols
[2024-06-01 14:48:05] [INFO ] Computed 44 invariants in 25 ms
[2024-06-01 14:48:05] [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-06-01 14:48:33] [INFO ] Deduced a trap composed of 48 places in 111 ms of which 2 ms to minimize.
[2024-06-01 14:48:33] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:48:33] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 1 ms to minimize.
[2024-06-01 14:48:33] [INFO ] Deduced a trap composed of 48 places in 44 ms of which 0 ms to minimize.
[2024-06-01 14:48:33] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:48:33] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 0 ms to minimize.
[2024-06-01 14:48:33] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:48:33] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 0 ms to minimize.
[2024-06-01 14:48:33] [INFO ] Deduced a trap composed of 48 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:48:34] [INFO ] Deduced a trap composed of 284 places in 337 ms of which 4 ms to minimize.
[2024-06-01 14:48:34] [INFO ] Deduced a trap composed of 48 places in 325 ms of which 3 ms to minimize.
[2024-06-01 14:48:35] [INFO ] Deduced a trap composed of 298 places in 334 ms of which 3 ms to minimize.
[2024-06-01 14:48:35] [INFO ] Deduced a trap composed of 271 places in 336 ms of which 3 ms to minimize.
[2024-06-01 14:48:35] [INFO ] Deduced a trap composed of 265 places in 330 ms of which 3 ms to minimize.
[2024-06-01 14:48:36] [INFO ] Deduced a trap composed of 246 places in 326 ms of which 3 ms to minimize.
[2024-06-01 14:48:36] [INFO ] Deduced a trap composed of 268 places in 457 ms of which 4 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 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 1.0)
(s19 1.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 1.0)
(s141 1.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 1.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 1.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 1.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 9.0)
(s183 0.0)
(s184 1.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 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 1.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 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 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 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 4.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 1.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.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 0.0)
(s485 0.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 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 1.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 1.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 572/2580 variables, and 56 constraints, problems are : Problem set: 0 solved, 2040 unsolved in 20031 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: 16/16 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, 16/56 constraints. Problems are: Problem set: 0 solved, 2040 unsolved
[2024-06-01 14:48:45] [INFO ] Deduced a trap composed of 310 places in 272 ms of which 3 ms to minimize.
[2024-06-01 14:48:46] [INFO ] Deduced a trap composed of 68 places in 124 ms of which 2 ms to minimize.
[2024-06-01 14:48:47] [INFO ] Deduced a trap composed of 44 places in 118 ms of which 1 ms to minimize.
[2024-06-01 14:48:47] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 1 ms to minimize.
[2024-06-01 14:48:47] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/2580 variables, and 61 constraints, problems are : Problem set: 0 solved, 2040 unsolved in 20023 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: 21/21 constraints]
After SMT, in 52133ms problems are : Problem set: 0 solved, 2040 unsolved
Search for dead transitions found 0 dead transitions in 52151ms
[2024-06-01 14:48:57] [INFO ] Flow matrix only has 2004 transitions (discarded 40 similar events)
[2024-06-01 14:48:57] [INFO ] Invariant cache hit.
[2024-06-01 14:48:57] [INFO ] Implicit Places using invariants in 583 ms returned []
[2024-06-01 14:48:57] [INFO ] Flow matrix only has 2004 transitions (discarded 40 similar events)
[2024-06-01 14:48:57] [INFO ] Invariant cache hit.
[2024-06-01 14:48:58] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 14:49:10] [INFO ] Implicit Places using invariants and state equation in 13034 ms returned []
Implicit Place search using SMT with State Equation took 13617 ms to find 0 implicit places.
Running 2040 sub problems to find dead transitions.
[2024-06-01 14:49:10] [INFO ] Flow matrix only has 2004 transitions (discarded 40 similar events)
[2024-06-01 14:49:10] [INFO ] Invariant cache hit.
[2024-06-01 14:49:10] [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-06-01 14:49:39] [INFO ] Deduced a trap composed of 48 places in 114 ms of which 2 ms to minimize.
[2024-06-01 14:49:39] [INFO ] Deduced a trap composed of 48 places in 93 ms of which 1 ms to minimize.
[2024-06-01 14:49:39] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:49:39] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 0 ms to minimize.
[2024-06-01 14:49:39] [INFO ] Deduced a trap composed of 48 places in 38 ms of which 0 ms to minimize.
[2024-06-01 14:49:39] [INFO ] Deduced a trap composed of 48 places in 37 ms of which 1 ms to minimize.
[2024-06-01 14:49:40] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 0 ms to minimize.
[2024-06-01 14:49:40] [INFO ] Deduced a trap composed of 48 places in 38 ms of which 0 ms to minimize.
[2024-06-01 14:49:40] [INFO ] Deduced a trap composed of 48 places in 37 ms of which 1 ms to minimize.
[2024-06-01 14:49:40] [INFO ] Deduced a trap composed of 268 places in 421 ms of which 4 ms to minimize.
[2024-06-01 14:49:41] [INFO ] Deduced a trap composed of 249 places in 381 ms of which 4 ms to minimize.
[2024-06-01 14:49:42] [INFO ] Deduced a trap composed of 48 places in 72 ms of which 1 ms to minimize.
[2024-06-01 14:49:45] [INFO ] Deduced a trap composed of 346 places in 295 ms of which 2 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 30031 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-06-01 14:50:01] [INFO ] Deduced a trap composed of 46 places in 149 ms of which 2 ms to minimize.
[2024-06-01 14:50:01] [INFO ] Deduced a trap composed of 44 places in 143 ms of which 1 ms to minimize.
[2024-06-01 14:50:02] [INFO ] Deduced a trap composed of 24 places in 166 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 30032 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 72523ms problems are : Problem set: 0 solved, 2040 unsolved
Search for dead transitions found 0 dead transitions in 72541ms
Starting structural reductions in LI_LTL mode, iteration 1 : 576/856 places, 2044/2324 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 138392 ms. Remains : 576/856 places, 2044/2324 transitions.
Running random walk in product with property : PolyORBLF-COL-S04J04T10-LTLFireability-02
Product exploration explored 100000 steps with 1695 reset in 568 ms.
Product exploration explored 100000 steps with 1697 reset in 498 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 132 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 67 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 249 steps (0 resets) in 6 ms. (35 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 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
[2024-06-01 14:50:25] [INFO ] Flow matrix only has 2004 transitions (discarded 40 similar events)
[2024-06-01 14:50:25] [INFO ] Invariant cache hit.
[2024-06-01 14:50:25] [INFO ] [Real]Absence check using 14 positive place invariants in 20 ms returned sat
[2024-06-01 14:50:26] [INFO ] [Real]Absence check using 14 positive and 30 generalized place invariants in 73 ms returned sat
[2024-06-01 14:50:28] [INFO ] [Real]Absence check using state equation in 2235 ms returned sat
[2024-06-01 14:50:28] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:50:29] [INFO ] [Nat]Absence check using 14 positive place invariants in 15 ms returned sat
[2024-06-01 14:50:29] [INFO ] [Nat]Absence check using 14 positive and 30 generalized place invariants in 199 ms returned sat
[2024-06-01 14:50:32] [INFO ] [Nat]Absence check using state equation in 3603 ms returned sat
[2024-06-01 14:50:32] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 14:50:33] [INFO ] [Nat]Added 200 Read/Feed constraints in 473 ms returned sat
[2024-06-01 14:50:33] [INFO ] Deduced a trap composed of 46 places in 350 ms of which 3 ms to minimize.
[2024-06-01 14:50:34] [INFO ] Deduced a trap composed of 48 places in 106 ms of which 2 ms to minimize.
[2024-06-01 14:50:35] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 2154 ms
Could not prove EG (NOT p0)
Support contains 10 out of 576 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 : 576/576 places, 2044/2044 transitions.
Applied a total of 0 rules in 25 ms. Remains 576 /576 variables (removed 0) and now considering 2044/2044 (removed 0) transitions.
Running 2040 sub problems to find dead transitions.
[2024-06-01 14:50:35] [INFO ] Flow matrix only has 2004 transitions (discarded 40 similar events)
[2024-06-01 14:50:35] [INFO ] Invariant cache hit.
[2024-06-01 14:50:35] [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-06-01 14:51:03] [INFO ] Deduced a trap composed of 48 places in 176 ms of which 2 ms to minimize.
[2024-06-01 14:51:03] [INFO ] Deduced a trap composed of 48 places in 129 ms of which 2 ms to minimize.
[2024-06-01 14:51:04] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 1 ms to minimize.
[2024-06-01 14:51:04] [INFO ] Deduced a trap composed of 48 places in 74 ms of which 2 ms to minimize.
[2024-06-01 14:51:04] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 0 ms to minimize.
[2024-06-01 14:51:04] [INFO ] Deduced a trap composed of 48 places in 38 ms of which 0 ms to minimize.
[2024-06-01 14:51:04] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:51:04] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 0 ms to minimize.
[2024-06-01 14:51:04] [INFO ] Deduced a trap composed of 48 places in 39 ms of which 0 ms to minimize.
[2024-06-01 14:51:05] [INFO ] Deduced a trap composed of 268 places in 449 ms of which 4 ms to minimize.
[2024-06-01 14:51:05] [INFO ] Deduced a trap composed of 249 places in 372 ms of which 2 ms to minimize.
[2024-06-01 14:51:06] [INFO ] Deduced a trap composed of 48 places in 70 ms of which 0 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 20071 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-06-01 14:51:10] [INFO ] Deduced a trap composed of 24 places in 140 ms of which 1 ms to minimize.
[2024-06-01 14:51:15] [INFO ] Deduced a trap composed of 231 places in 476 ms of which 4 ms to minimize.
[2024-06-01 14:51:15] [INFO ] Deduced a trap composed of 229 places in 444 ms of which 3 ms to minimize.
[2024-06-01 14:51:16] [INFO ] Deduced a trap composed of 310 places in 414 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 20033 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 52062ms problems are : Problem set: 0 solved, 2040 unsolved
Search for dead transitions found 0 dead transitions in 52080ms
[2024-06-01 14:51:27] [INFO ] Flow matrix only has 2004 transitions (discarded 40 similar events)
[2024-06-01 14:51:27] [INFO ] Invariant cache hit.
[2024-06-01 14:51:28] [INFO ] Implicit Places using invariants in 575 ms returned []
[2024-06-01 14:51:28] [INFO ] Flow matrix only has 2004 transitions (discarded 40 similar events)
[2024-06-01 14:51:28] [INFO ] Invariant cache hit.
[2024-06-01 14:51:29] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 14:51:41] [INFO ] Implicit Places using invariants and state equation in 12830 ms returned []
Implicit Place search using SMT with State Equation took 13407 ms to find 0 implicit places.
[2024-06-01 14:51:41] [INFO ] Redundant transitions in 28 ms returned []
Running 2040 sub problems to find dead transitions.
[2024-06-01 14:51:41] [INFO ] Flow matrix only has 2004 transitions (discarded 40 similar events)
[2024-06-01 14:51:41] [INFO ] Invariant cache hit.
[2024-06-01 14:51:41] [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-06-01 14:52:12] [INFO ] Deduced a trap composed of 48 places in 138 ms of which 2 ms to minimize.
[2024-06-01 14:52:12] [INFO ] Deduced a trap composed of 48 places in 87 ms of which 2 ms to minimize.
[2024-06-01 14:52:12] [INFO ] Deduced a trap composed of 48 places in 76 ms of which 2 ms to minimize.
[2024-06-01 14:52:12] [INFO ] Deduced a trap composed of 48 places in 86 ms of which 1 ms to minimize.
[2024-06-01 14:52:12] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 0 ms to minimize.
[2024-06-01 14:52:12] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:52:12] [INFO ] Deduced a trap composed of 48 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:52:13] [INFO ] Deduced a trap composed of 48 places in 60 ms of which 1 ms to minimize.
[2024-06-01 14:52:13] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:52:13] [INFO ] Deduced a trap composed of 268 places in 486 ms of which 4 ms to minimize.
[2024-06-01 14:52:14] [INFO ] Deduced a trap composed of 249 places in 508 ms of which 4 ms to minimize.
[2024-06-01 14:52:15] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:52:18] [INFO ] Deduced a trap composed of 346 places in 405 ms of which 4 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 572/2580 variables, and 53 constraints, problems are : Problem set: 0 solved, 2040 unsolved in 30037 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-06-01 14:52:35] [INFO ] Deduced a trap composed of 46 places in 152 ms of which 2 ms to minimize.
[2024-06-01 14:52:35] [INFO ] Deduced a trap composed of 44 places in 148 ms of which 2 ms to minimize.
[2024-06-01 14:52:36] [INFO ] Deduced a trap composed of 24 places in 184 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 30030 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 75743ms problems are : Problem set: 0 solved, 2040 unsolved
Search for dead transitions found 0 dead transitions in 75765ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 141320 ms. Remains : 576/576 places, 2044/2044 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 82 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 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 220 steps (0 resets) in 6 ms. (31 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
[2024-06-01 14:52:57] [INFO ] Flow matrix only has 2004 transitions (discarded 40 similar events)
[2024-06-01 14:52:57] [INFO ] Invariant cache hit.
[2024-06-01 14:52:58] [INFO ] [Real]Absence check using 14 positive place invariants in 16 ms returned sat
[2024-06-01 14:52:58] [INFO ] [Real]Absence check using 14 positive and 30 generalized place invariants in 66 ms returned sat
[2024-06-01 14:53:00] [INFO ] [Real]Absence check using state equation in 2093 ms returned sat
[2024-06-01 14:53:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:53:01] [INFO ] [Nat]Absence check using 14 positive place invariants in 15 ms returned sat
[2024-06-01 14:53:01] [INFO ] [Nat]Absence check using 14 positive and 30 generalized place invariants in 182 ms returned sat
[2024-06-01 14:53:04] [INFO ] [Nat]Absence check using state equation in 3437 ms returned sat
[2024-06-01 14:53:04] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 14:53:05] [INFO ] [Nat]Added 200 Read/Feed constraints in 431 ms returned sat
[2024-06-01 14:53:05] [INFO ] Deduced a trap composed of 46 places in 256 ms of which 2 ms to minimize.
[2024-06-01 14:53:05] [INFO ] Deduced a trap composed of 48 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:53:07] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 1993 ms
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1691 reset in 533 ms.
Product exploration explored 100000 steps with 1685 reset in 449 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 26 ms. Remains 576 /576 variables (removed 0) and now considering 2044/2044 (removed 0) transitions.
Running 2040 sub problems to find dead transitions.
[2024-06-01 14:53:08] [INFO ] Flow matrix only has 2004 transitions (discarded 40 similar events)
[2024-06-01 14:53:08] [INFO ] Invariant cache hit.
[2024-06-01 14:53:08] [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-06-01 14:53:38] [INFO ] Deduced a trap composed of 48 places in 240 ms of which 2 ms to minimize.
[2024-06-01 14:53:38] [INFO ] Deduced a trap composed of 48 places in 123 ms of which 1 ms to minimize.
[2024-06-01 14:53:38] [INFO ] Deduced a trap composed of 48 places in 94 ms of which 1 ms to minimize.
[2024-06-01 14:53:38] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:53:39] [INFO ] Deduced a trap composed of 48 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:53:39] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:53:39] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:53:39] [INFO ] Deduced a trap composed of 48 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:53:39] [INFO ] Deduced a trap composed of 48 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:53:40] [INFO ] Deduced a trap composed of 268 places in 468 ms of which 4 ms to minimize.
[2024-06-01 14:53:40] [INFO ] Deduced a trap composed of 249 places in 424 ms of which 3 ms to minimize.
[2024-06-01 14:53:41] [INFO ] Deduced a trap composed of 48 places in 32 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-06-01 14:53:45] [INFO ] Deduced a trap composed of 24 places in 186 ms of which 2 ms to minimize.
[2024-06-01 14:53:50] [INFO ] Deduced a trap composed of 231 places in 408 ms of which 4 ms to minimize.
[2024-06-01 14:53:50] [INFO ] Deduced a trap composed of 229 places in 412 ms of which 3 ms to minimize.
[2024-06-01 14:53:51] [INFO ] Deduced a trap composed of 310 places in 425 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 54061ms problems are : Problem set: 0 solved, 2040 unsolved
Search for dead transitions found 0 dead transitions in 54079ms
[2024-06-01 14:54:02] [INFO ] Flow matrix only has 2004 transitions (discarded 40 similar events)
[2024-06-01 14:54:02] [INFO ] Invariant cache hit.
[2024-06-01 14:54:03] [INFO ] Implicit Places using invariants in 561 ms returned []
[2024-06-01 14:54:03] [INFO ] Flow matrix only has 2004 transitions (discarded 40 similar events)
[2024-06-01 14:54:03] [INFO ] Invariant cache hit.
[2024-06-01 14:54:04] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 14:54:16] [INFO ] Implicit Places using invariants and state equation in 13704 ms returned []
Implicit Place search using SMT with State Equation took 14266 ms to find 0 implicit places.
[2024-06-01 14:54:16] [INFO ] Redundant transitions in 50 ms returned []
Running 2040 sub problems to find dead transitions.
[2024-06-01 14:54:16] [INFO ] Flow matrix only has 2004 transitions (discarded 40 similar events)
[2024-06-01 14:54:16] [INFO ] Invariant cache hit.
[2024-06-01 14:54:16] [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-06-01 14:54:45] [INFO ] Deduced a trap composed of 48 places in 157 ms of which 3 ms to minimize.
[2024-06-01 14:54:45] [INFO ] Deduced a trap composed of 48 places in 110 ms of which 1 ms to minimize.
[2024-06-01 14:54:45] [INFO ] Deduced a trap composed of 48 places in 92 ms of which 2 ms to minimize.
[2024-06-01 14:54:45] [INFO ] Deduced a trap composed of 48 places in 88 ms of which 1 ms to minimize.
[2024-06-01 14:54:45] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:54:45] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:54:45] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:54:45] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:54:45] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 0 ms to minimize.
[2024-06-01 14:54:46] [INFO ] Deduced a trap composed of 268 places in 468 ms of which 4 ms to minimize.
[2024-06-01 14:54:46] [INFO ] Deduced a trap composed of 249 places in 391 ms of which 3 ms to minimize.
[2024-06-01 14:54:47] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:54:50] [INFO ] Deduced a trap composed of 346 places in 364 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 30030 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-06-01 14:55:07] [INFO ] Deduced a trap composed of 46 places in 180 ms of which 2 ms to minimize.
[2024-06-01 14:55:07] [INFO ] Deduced a trap composed of 44 places in 173 ms of which 2 ms to minimize.
[2024-06-01 14:55:08] [INFO ] Deduced a trap composed of 24 places in 170 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 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: 0/2040 constraints, Known Traps: 16/16 constraints]
After SMT, in 72972ms problems are : Problem set: 0 solved, 2040 unsolved
Search for dead transitions found 0 dead transitions in 73002ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 141435 ms. Remains : 576/576 places, 2044/2044 transitions.
Treatment of property PolyORBLF-COL-S04J04T10-LTLFireability-02 finished in 445032 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)))))'
Found a Shortening insensitive property : PolyORBLF-COL-S04J04T10-LTLFireability-07
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p0), (NOT p1), (AND (NOT p2) (NOT p3))]
Support contains 82 out of 856 places. Attempting structural reductions.
Starting structural reductions in LI_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 1 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 1 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 59 ms. Remains 596 /856 variables (removed 260) and now considering 2064/2324 (removed 260) transitions.
Running 2060 sub problems to find dead transitions.
[2024-06-01 14:55:30] [INFO ] Flow matrix only has 2024 transitions (discarded 40 similar events)
// Phase 1: matrix 2024 rows 596 cols
[2024-06-01 14:55:30] [INFO ] Computed 44 invariants in 23 ms
[2024-06-01 14:55:30] [INFO ] State equation strengthened by 200 read => feed constraints.

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="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is PolyORBLF-COL-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 r516-tajo-171654446400140"
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 ;