Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r377-smll-171683809800164.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is SimpleLoadBal-PT-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r377-smll-171683809800164
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.0M
-rw-r--r-- 1 mcc users 8.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 13 12:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Apr 13 12:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 13 12:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 13 12:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 535K 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 SimpleLoadBal-PT-10-LTLFireability-00
FORMULA_NAME SimpleLoadBal-PT-10-LTLFireability-01
FORMULA_NAME SimpleLoadBal-PT-10-LTLFireability-02
FORMULA_NAME SimpleLoadBal-PT-10-LTLFireability-03
FORMULA_NAME SimpleLoadBal-PT-10-LTLFireability-04
FORMULA_NAME SimpleLoadBal-PT-10-LTLFireability-05
FORMULA_NAME SimpleLoadBal-PT-10-LTLFireability-06
FORMULA_NAME SimpleLoadBal-PT-10-LTLFireability-07
FORMULA_NAME SimpleLoadBal-PT-10-LTLFireability-08
FORMULA_NAME SimpleLoadBal-PT-10-LTLFireability-09
FORMULA_NAME SimpleLoadBal-PT-10-LTLFireability-10
FORMULA_NAME SimpleLoadBal-PT-10-LTLFireability-11
FORMULA_NAME SimpleLoadBal-PT-10-LTLFireability-12
FORMULA_NAME SimpleLoadBal-PT-10-LTLFireability-13
FORMULA_NAME SimpleLoadBal-PT-10-LTLFireability-14
FORMULA_NAME SimpleLoadBal-PT-10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716937269531

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SimpleLoadBal-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 23:01:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 23:01:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 23:01:11] [INFO ] Load time of PNML (sax parser for PT used): 190 ms
[2024-05-28 23:01:11] [INFO ] Transformed 104 places.
[2024-05-28 23:01:11] [INFO ] Transformed 605 transitions.
[2024-05-28 23:01:11] [INFO ] Found NUPN structural information;
[2024-05-28 23:01:11] [INFO ] Completing missing partition info from NUPN : creating a component with [P_client_idle_1, P_client_idle_2, P_client_idle_3, P_client_idle_4, P_client_idle_5, P_client_idle_6, P_client_idle_7, P_client_idle_8, P_client_idle_9, P_client_idle_10, P_client_waiting_1, P_client_waiting_2, P_client_waiting_3, P_client_waiting_4, P_client_waiting_5, P_client_waiting_6, P_client_waiting_7, P_client_waiting_8, P_client_waiting_9, P_client_waiting_10, P_client_request_1, P_client_request_2, P_client_request_3, P_client_request_4, P_client_request_5, P_client_request_6, P_client_request_7, P_client_request_8, P_client_request_9, P_client_request_10, P_client_ack_1, P_client_ack_2, P_client_ack_3, P_client_ack_4, P_client_ack_5, P_client_ack_6, P_client_ack_7, P_client_ack_8, P_client_ack_9, P_client_ack_10, P_server_idle_1, P_server_idle_2, P_server_waiting_1, P_server_waiting_2, P_server_processed_1, P_server_processed_2, P_server_notification_1, P_server_notification_2, P_server_notification_ack_1, P_server_notification_ack_2, P_server_request_1_1, P_server_request_1_2, P_server_request_2_1, P_server_request_2_2, P_server_request_3_1, P_server_request_3_2, P_server_request_4_1, P_server_request_4_2, P_server_request_5_1, P_server_request_5_2, P_server_request_6_1, P_server_request_6_2, P_server_request_7_1, P_server_request_7_2, P_server_request_8_1, P_server_request_8_2, P_server_request_9_1, P_server_request_9_2, P_server_request_10_1, P_server_request_10_2, P_lb_idle_1, P_lb_routing_1_1, P_lb_routing_1_2, P_lb_routing_1_3, P_lb_routing_1_4, P_lb_routing_1_5, P_lb_routing_1_6, P_lb_routing_1_7, P_lb_routing_1_8, P_lb_routing_1_9, P_lb_routing_1_10, P_lb_balancing_1, P_lb_load_1_0, P_lb_load_1_1, P_lb_load_1_2, P_lb_load_1_3, P_lb_load_1_4, P_lb_load_1_5, P_lb_load_1_6, P_lb_load_1_7, P_lb_load_1_8, P_lb_load_1_9, P_lb_load_1_10, P_lb_load_2_0, P_lb_load_2_1, P_lb_load_2_2, P_lb_load_2_3, P_lb_load_2_4, P_lb_load_2_5, P_lb_load_2_6, P_lb_load_2_7, P_lb_load_2_8, P_lb_load_2_9, P_lb_load_2_10]
[2024-05-28 23:01:11] [INFO ] Parsed PT model containing 104 places and 605 transitions and 4148 arcs in 369 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA SimpleLoadBal-PT-10-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 605/605 transitions.
Applied a total of 0 rules in 32 ms. Remains 104 /104 variables (removed 0) and now considering 605/605 (removed 0) transitions.
[2024-05-28 23:01:12] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
// Phase 1: matrix 475 rows 104 cols
[2024-05-28 23:01:12] [INFO ] Computed 29 invariants in 40 ms
[2024-05-28 23:01:12] [INFO ] Implicit Places using invariants in 516 ms returned [10, 11, 12, 13, 14, 16, 17, 18, 19, 42, 43]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 572 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 93/104 places, 605/605 transitions.
Applied a total of 0 rules in 9 ms. Remains 93 /93 variables (removed 0) and now considering 605/605 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 642 ms. Remains : 93/104 places, 605/605 transitions.
Support contains 48 out of 93 places after structural reductions.
[2024-05-28 23:01:13] [INFO ] Flatten gal took : 137 ms
[2024-05-28 23:01:13] [INFO ] Flatten gal took : 83 ms
[2024-05-28 23:01:13] [INFO ] Input system was already deterministic with 605 transitions.
Reduction of identical properties reduced properties to check from 32 to 31
RANDOM walk for 40000 steps (8 resets) in 2872 ms. (13 steps per ms) remains 15/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 55 ms. (71 steps per ms) remains 12/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4003 steps (8 resets) in 56 ms. (70 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 12/12 properties
[2024-05-28 23:01:14] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
// Phase 1: matrix 475 rows 93 cols
[2024-05-28 23:01:14] [INFO ] Computed 18 invariants in 11 ms
[2024-05-28 23:01:14] [INFO ] State equation strengthened by 210 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp31 is UNSAT
At refinement iteration 2 (OVERLAPS) 44/77 variables, 12/45 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 44/89 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/89 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 12/89 variables, 4/93 constraints. Problems are: Problem set: 2 solved, 10 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp24 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 12/105 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 0/105 constraints. Problems are: Problem set: 6 solved, 6 unsolved
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp18 is UNSAT
At refinement iteration 8 (OVERLAPS) 4/93 variables, 2/107 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/93 variables, 4/111 constraints. Problems are: Problem set: 9 solved, 3 unsolved
[2024-05-28 23:01:15] [INFO ] Deduced a trap composed of 57 places in 240 ms of which 16 ms to minimize.
Problem AtomicPropp19 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/93 variables, 1/112 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/93 variables, 0/112 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 475/568 variables, 93/205 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/568 variables, 210/415 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/568 variables, 0/415 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/568 variables, 0/415 constraints. Problems are: Problem set: 10 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 415 constraints, problems are : Problem set: 10 solved, 2 unsolved in 1027 ms.
Refiners :[Domain max(s): 93/93 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 93/93 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 10 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 31/41 variables, 5/15 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 31/46 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/46 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 31/72 variables, 7/53 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 31/84 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/84 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 17/89 variables, 4/88 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/89 variables, 17/105 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/89 variables, 0/105 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/93 variables, 2/107 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/93 variables, 4/111 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/93 variables, 1/112 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/93 variables, 0/112 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 475/568 variables, 93/205 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/568 variables, 210/415 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/568 variables, 2/417 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/568 variables, 0/417 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/568 variables, 0/417 constraints. Problems are: Problem set: 10 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 568/568 variables, and 417 constraints, problems are : Problem set: 10 solved, 2 unsolved in 775 ms.
Refiners :[Domain max(s): 93/93 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 93/93 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 2/12 constraints, Known Traps: 1/1 constraints]
After SMT, in 2082ms problems are : Problem set: 10 solved, 2 unsolved
Finished Parikh walk after 10334 steps, including 831 resets, run visited all 2 properties in 214 ms. (steps per millisecond=48 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 223 ms.
Successfully simplified 10 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA SimpleLoadBal-PT-10-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA SimpleLoadBal-PT-10-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 7 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 605/605 transitions.
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 0 place count 93 transition count 594
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 82 transition count 594
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 71 transition count 583
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 47 place count 69 transition count 582
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 49 place count 68 transition count 581
Applied a total of 49 rules in 119 ms. Remains 68 /93 variables (removed 25) and now considering 581/605 (removed 24) transitions.
[2024-05-28 23:01:17] [INFO ] Flow matrix only has 451 transitions (discarded 130 similar events)
// Phase 1: matrix 451 rows 68 cols
[2024-05-28 23:01:17] [INFO ] Computed 17 invariants in 10 ms
[2024-05-28 23:01:17] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-05-28 23:01:17] [INFO ] Flow matrix only has 451 transitions (discarded 130 similar events)
[2024-05-28 23:01:17] [INFO ] Invariant cache hit.
[2024-05-28 23:01:17] [INFO ] State equation strengthened by 210 read => feed constraints.
[2024-05-28 23:01:18] [INFO ] Implicit Places using invariants and state equation in 641 ms returned []
Implicit Place search using SMT with State Equation took 861 ms to find 0 implicit places.
[2024-05-28 23:01:18] [INFO ] Redundant transitions in 36 ms returned []
Running 571 sub problems to find dead transitions.
[2024-05-28 23:01:18] [INFO ] Flow matrix only has 451 transitions (discarded 130 similar events)
[2024-05-28 23:01:18] [INFO ] Invariant cache hit.
[2024-05-28 23:01:18] [INFO ] State equation strengthened by 210 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 4 (OVERLAPS) 9/67 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 9/81 constraints. Problems are: Problem set: 0 solved, 571 unsolved
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 2/83 constraints. Problems are: Problem set: 178 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/83 constraints. Problems are: Problem set: 178 solved, 393 unsolved
Problem TDEAD13 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
At refinement iteration 8 (OVERLAPS) 1/68 variables, 1/84 constraints. Problems are: Problem set: 192 solved, 379 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/68 variables, 1/85 constraints. Problems are: Problem set: 192 solved, 379 unsolved
[2024-05-28 23:01:31] [INFO ] Deduced a trap composed of 26 places in 156 ms of which 2 ms to minimize.
Problem TDEAD319 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
[2024-05-28 23:01:31] [INFO ] Deduced a trap composed of 33 places in 136 ms of which 1 ms to minimize.
[2024-05-28 23:01:31] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 1 ms to minimize.
[2024-05-28 23:01:32] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 1 ms to minimize.
Problem TDEAD547 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD551 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/68 variables, 4/89 constraints. Problems are: Problem set: 216 solved, 355 unsolved
[2024-05-28 23:01:33] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 1 ms to minimize.
[2024-05-28 23:01:33] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 1 ms to minimize.
[2024-05-28 23:01:33] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 2 ms to minimize.
[2024-05-28 23:01:34] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 1 ms to minimize.
[2024-05-28 23:01:34] [INFO ] Deduced a trap composed of 13 places in 158 ms of which 1 ms to minimize.
Problem TDEAD574 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD546 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/68 variables, 5/94 constraints. Problems are: Problem set: 221 solved, 350 unsolved
[2024-05-28 23:01:35] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 1 ms to minimize.
[2024-05-28 23:01:35] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 1 ms to minimize.
[2024-05-28 23:01:36] [INFO ] Deduced a trap composed of 17 places in 155 ms of which 1 ms to minimize.
[2024-05-28 23:01:36] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 1 ms to minimize.
[2024-05-28 23:01:36] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/68 variables, 5/99 constraints. Problems are: Problem set: 221 solved, 350 unsolved
[2024-05-28 23:01:38] [INFO ] Deduced a trap composed of 32 places in 146 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/68 variables, 1/100 constraints. Problems are: Problem set: 221 solved, 350 unsolved
[2024-05-28 23:01:39] [INFO ] Deduced a trap composed of 32 places in 127 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/68 variables, 1/101 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/68 variables, 0/101 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 16 (OVERLAPS) 451/519 variables, 68/169 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/519 variables, 210/379 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/519 variables, 0/379 constraints. Problems are: Problem set: 221 solved, 350 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 519/519 variables, and 379 constraints, problems are : Problem set: 221 solved, 350 unsolved in 30028 ms.
Refiners :[Domain max(s): 68/68 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 68/68 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 571/571 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 221 solved, 350 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 4/62 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/63 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 12/75 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/75 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 5 (OVERLAPS) 9/67 variables, 9/84 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 9/93 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 2/95 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 0/95 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 9 (OVERLAPS) 1/68 variables, 1/96 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/68 variables, 1/97 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/68 variables, 4/101 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/68 variables, 0/101 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 13 (OVERLAPS) 451/519 variables, 68/169 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/519 variables, 210/379 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/519 variables, 350/729 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/519 variables, 0/729 constraints. Problems are: Problem set: 221 solved, 350 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 519/519 variables, and 729 constraints, problems are : Problem set: 221 solved, 350 unsolved in 30021 ms.
Refiners :[Domain max(s): 68/68 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 68/68 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 350/571 constraints, Known Traps: 16/16 constraints]
After SMT, in 62899ms problems are : Problem set: 221 solved, 350 unsolved
Search for dead transitions found 221 dead transitions in 62913ms
Found 221 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 221 transitions
Dead transitions reduction (with SMT) removed 221 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 68/93 places, 360/605 transitions.
Reduce places removed 2 places and 2 transitions.
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 64 transition count 356
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 62 transition count 354
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 60 transition count 352
Applied a total of 6 rules in 24 ms. Remains 60 /68 variables (removed 8) and now considering 352/360 (removed 8) transitions.
[2024-05-28 23:02:21] [INFO ] Flow matrix only has 275 transitions (discarded 77 similar events)
// Phase 1: matrix 275 rows 60 cols
[2024-05-28 23:02:21] [INFO ] Computed 17 invariants in 4 ms
[2024-05-28 23:02:21] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-28 23:02:21] [INFO ] Flow matrix only has 275 transitions (discarded 77 similar events)
[2024-05-28 23:02:21] [INFO ] Invariant cache hit.
[2024-05-28 23:02:21] [INFO ] State equation strengthened by 122 read => feed constraints.
[2024-05-28 23:02:21] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 60/93 places, 352/605 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 64476 ms. Remains : 60/93 places, 352/605 transitions.
Stuttering acceptance computed with spot in 268 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SimpleLoadBal-PT-10-LTLFireability-00
Product exploration explored 100000 steps with 70 reset in 631 ms.
Stack based approach found an accepted trace after 143 steps with 0 reset with depth 144 and stack size 144 in 1 ms.
FORMULA SimpleLoadBal-PT-10-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property SimpleLoadBal-PT-10-LTLFireability-00 finished in 65464 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(X(G(p2))&&p1)))))'
Support contains 12 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 605/605 transitions.
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 0 place count 93 transition count 594
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 82 transition count 594
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 71 transition count 583
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 47 place count 69 transition count 582
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 49 place count 68 transition count 581
Applied a total of 49 rules in 62 ms. Remains 68 /93 variables (removed 25) and now considering 581/605 (removed 24) transitions.
[2024-05-28 23:02:22] [INFO ] Flow matrix only has 451 transitions (discarded 130 similar events)
// Phase 1: matrix 451 rows 68 cols
[2024-05-28 23:02:22] [INFO ] Computed 17 invariants in 5 ms
[2024-05-28 23:02:23] [INFO ] Implicit Places using invariants in 293 ms returned []
[2024-05-28 23:02:23] [INFO ] Flow matrix only has 451 transitions (discarded 130 similar events)
[2024-05-28 23:02:23] [INFO ] Invariant cache hit.
[2024-05-28 23:02:23] [INFO ] State equation strengthened by 210 read => feed constraints.
[2024-05-28 23:02:23] [INFO ] Implicit Places using invariants and state equation in 630 ms returned []
Implicit Place search using SMT with State Equation took 928 ms to find 0 implicit places.
[2024-05-28 23:02:23] [INFO ] Redundant transitions in 6 ms returned []
Running 571 sub problems to find dead transitions.
[2024-05-28 23:02:23] [INFO ] Flow matrix only has 451 transitions (discarded 130 similar events)
[2024-05-28 23:02:23] [INFO ] Invariant cache hit.
[2024-05-28 23:02:23] [INFO ] State equation strengthened by 210 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 4 (OVERLAPS) 9/67 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 9/81 constraints. Problems are: Problem set: 0 solved, 571 unsolved
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 2/83 constraints. Problems are: Problem set: 178 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/83 constraints. Problems are: Problem set: 178 solved, 393 unsolved
Problem TDEAD13 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
At refinement iteration 8 (OVERLAPS) 1/68 variables, 1/84 constraints. Problems are: Problem set: 192 solved, 379 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/68 variables, 1/85 constraints. Problems are: Problem set: 192 solved, 379 unsolved
[2024-05-28 23:02:35] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 2 ms to minimize.
Problem TDEAD319 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
[2024-05-28 23:02:36] [INFO ] Deduced a trap composed of 33 places in 135 ms of which 3 ms to minimize.
[2024-05-28 23:02:36] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 11 ms to minimize.
[2024-05-28 23:02:36] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 1 ms to minimize.
Problem TDEAD547 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD551 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/68 variables, 4/89 constraints. Problems are: Problem set: 216 solved, 355 unsolved
[2024-05-28 23:02:38] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 2 ms to minimize.
[2024-05-28 23:02:38] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 3 ms to minimize.
[2024-05-28 23:02:38] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 1 ms to minimize.
[2024-05-28 23:02:38] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 1 ms to minimize.
[2024-05-28 23:02:38] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 1 ms to minimize.
Problem TDEAD574 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD546 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/68 variables, 5/94 constraints. Problems are: Problem set: 221 solved, 350 unsolved
[2024-05-28 23:02:40] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 1 ms to minimize.
[2024-05-28 23:02:40] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 1 ms to minimize.
[2024-05-28 23:02:40] [INFO ] Deduced a trap composed of 17 places in 160 ms of which 1 ms to minimize.
[2024-05-28 23:02:41] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 1 ms to minimize.
[2024-05-28 23:02:41] [INFO ] Deduced a trap composed of 14 places in 160 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/68 variables, 5/99 constraints. Problems are: Problem set: 221 solved, 350 unsolved
[2024-05-28 23:02:43] [INFO ] Deduced a trap composed of 32 places in 154 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/68 variables, 1/100 constraints. Problems are: Problem set: 221 solved, 350 unsolved
[2024-05-28 23:02:44] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/68 variables, 1/101 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/68 variables, 0/101 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 16 (OVERLAPS) 451/519 variables, 68/169 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/519 variables, 210/379 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/519 variables, 0/379 constraints. Problems are: Problem set: 221 solved, 350 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 519/519 variables, and 379 constraints, problems are : Problem set: 221 solved, 350 unsolved in 30014 ms.
Refiners :[Domain max(s): 68/68 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 68/68 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 571/571 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 221 solved, 350 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 4/62 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/63 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 12/75 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/75 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 5 (OVERLAPS) 9/67 variables, 9/84 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 9/93 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 2/95 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 0/95 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 9 (OVERLAPS) 1/68 variables, 1/96 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/68 variables, 1/97 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/68 variables, 4/101 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/68 variables, 0/101 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 13 (OVERLAPS) 451/519 variables, 68/169 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/519 variables, 210/379 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/519 variables, 350/729 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/519 variables, 0/729 constraints. Problems are: Problem set: 221 solved, 350 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 519/519 variables, and 729 constraints, problems are : Problem set: 221 solved, 350 unsolved in 30015 ms.
Refiners :[Domain max(s): 68/68 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 68/68 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 350/571 constraints, Known Traps: 16/16 constraints]
After SMT, in 62420ms problems are : Problem set: 221 solved, 350 unsolved
Search for dead transitions found 221 dead transitions in 62430ms
Found 221 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 221 transitions
Dead transitions reduction (with SMT) removed 221 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 68/93 places, 360/605 transitions.
Reduce places removed 2 places and 2 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 65 transition count 356
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 64 transition count 354
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 4 place count 62 transition count 352
Deduced a syphon composed of 2 places in 2 ms
Applied a total of 4 rules in 21 ms. Remains 62 /68 variables (removed 6) and now considering 352/360 (removed 8) transitions.
[2024-05-28 23:03:26] [INFO ] Flow matrix only has 275 transitions (discarded 77 similar events)
// Phase 1: matrix 275 rows 62 cols
[2024-05-28 23:03:26] [INFO ] Computed 19 invariants in 2 ms
[2024-05-28 23:03:26] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-28 23:03:26] [INFO ] Flow matrix only has 275 transitions (discarded 77 similar events)
[2024-05-28 23:03:26] [INFO ] Invariant cache hit.
[2024-05-28 23:03:26] [INFO ] State equation strengthened by 122 read => feed constraints.
[2024-05-28 23:03:26] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 62/93 places, 352/605 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 63912 ms. Remains : 62/93 places, 352/605 transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : SimpleLoadBal-PT-10-LTLFireability-04
Product exploration explored 100000 steps with 31 reset in 509 ms.
Stack based approach found an accepted trace after 80 steps with 0 reset with depth 81 and stack size 81 in 1 ms.
FORMULA SimpleLoadBal-PT-10-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property SimpleLoadBal-PT-10-LTLFireability-04 finished in 64603 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p1)||p0))))'
Support contains 7 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 605/605 transitions.
Applied a total of 0 rules in 3 ms. Remains 93 /93 variables (removed 0) and now considering 605/605 (removed 0) transitions.
[2024-05-28 23:03:27] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
// Phase 1: matrix 475 rows 93 cols
[2024-05-28 23:03:27] [INFO ] Computed 18 invariants in 5 ms
[2024-05-28 23:03:27] [INFO ] Implicit Places using invariants in 263 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 265 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 92/93 places, 605/605 transitions.
Applied a total of 0 rules in 3 ms. Remains 92 /92 variables (removed 0) and now considering 605/605 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 272 ms. Remains : 92/93 places, 605/605 transitions.
Stuttering acceptance computed with spot in 190 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SimpleLoadBal-PT-10-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 364 ms.
Product exploration explored 100000 steps with 0 reset in 410 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 103 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 36591 steps (7 resets) in 852 ms. (42 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 6 factoid took 211 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 7 out of 92 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 605/605 transitions.
Applied a total of 0 rules in 2 ms. Remains 92 /92 variables (removed 0) and now considering 605/605 (removed 0) transitions.
[2024-05-28 23:03:29] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
// Phase 1: matrix 475 rows 92 cols
[2024-05-28 23:03:29] [INFO ] Computed 17 invariants in 5 ms
[2024-05-28 23:03:29] [INFO ] Implicit Places using invariants in 227 ms returned []
[2024-05-28 23:03:29] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
[2024-05-28 23:03:29] [INFO ] Invariant cache hit.
[2024-05-28 23:03:29] [INFO ] State equation strengthened by 210 read => feed constraints.
[2024-05-28 23:03:30] [INFO ] Implicit Places using invariants and state equation in 958 ms returned []
Implicit Place search using SMT with State Equation took 1187 ms to find 0 implicit places.
Running 595 sub problems to find dead transitions.
[2024-05-28 23:03:30] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
[2024-05-28 23:03:30] [INFO ] Invariant cache hit.
[2024-05-28 23:03:30] [INFO ] State equation strengthened by 210 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 82/82 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 5/87 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-05-28 23:03:35] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 2 ms to minimize.
Problem TDEAD404 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 1/89 constraints. Problems are: Problem set: 1 solved, 594 unsolved
[2024-05-28 23:03:40] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 1/90 constraints. Problems are: Problem set: 1 solved, 594 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/90 constraints. Problems are: Problem set: 1 solved, 594 unsolved
At refinement iteration 6 (OVERLAPS) 9/91 variables, 9/99 constraints. Problems are: Problem set: 1 solved, 594 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 9/108 constraints. Problems are: Problem set: 1 solved, 594 unsolved
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 1/109 constraints. Problems are: Problem set: 178 solved, 417 unsolved
[2024-05-28 23:03:47] [INFO ] Deduced a trap composed of 14 places in 161 ms of which 2 ms to minimize.
[2024-05-28 23:03:47] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 1 ms to minimize.
[2024-05-28 23:03:47] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 1 ms to minimize.
[2024-05-28 23:03:47] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 1 ms to minimize.
[2024-05-28 23:03:47] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 1 ms to minimize.
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
[2024-05-28 23:03:48] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 2 ms to minimize.
[2024-05-28 23:03:48] [INFO ] Deduced a trap composed of 16 places in 156 ms of which 1 ms to minimize.
[2024-05-28 23:03:48] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 1 ms to minimize.
[2024-05-28 23:03:48] [INFO ] Deduced a trap composed of 14 places in 149 ms of which 1 ms to minimize.
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/91 variables, 9/118 constraints. Problems are: Problem set: 184 solved, 411 unsolved
[2024-05-28 23:03:51] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/91 variables, 1/119 constraints. Problems are: Problem set: 184 solved, 411 unsolved
[2024-05-28 23:03:53] [INFO ] Deduced a trap composed of 14 places in 159 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/91 variables, 1/120 constraints. Problems are: Problem set: 184 solved, 411 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/91 variables, 0/120 constraints. Problems are: Problem set: 184 solved, 411 unsolved
Problem TDEAD66 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
At refinement iteration 13 (OVERLAPS) 1/92 variables, 1/121 constraints. Problems are: Problem set: 200 solved, 395 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/92 variables, 1/122 constraints. Problems are: Problem set: 200 solved, 395 unsolved
[2024-05-28 23:03:58] [INFO ] Deduced a trap composed of 53 places in 141 ms of which 1 ms to minimize.
[2024-05-28 23:03:59] [INFO ] Deduced a trap composed of 53 places in 138 ms of which 2 ms to minimize.
[2024-05-28 23:03:59] [INFO ] Deduced a trap composed of 49 places in 151 ms of which 1 ms to minimize.
Problem TDEAD392 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
[2024-05-28 23:04:00] [INFO ] Deduced a trap composed of 54 places in 157 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/92 variables, 4/126 constraints. Problems are: Problem set: 221 solved, 374 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 92/567 variables, and 126 constraints, problems are : Problem set: 221 solved, 374 unsolved in 30013 ms.
Refiners :[Domain max(s): 92/92 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/92 constraints, ReadFeed: 0/210 constraints, PredecessorRefiner: 595/595 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 221 solved, 374 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 82/82 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 5/87 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 1/88 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 13/101 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/101 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 5 (OVERLAPS) 9/91 variables, 9/110 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 9/119 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 1/120 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 0/120 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 9 (OVERLAPS) 1/92 variables, 1/121 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 1/122 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/92 variables, 4/126 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/92 variables, 0/126 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 13 (OVERLAPS) 475/567 variables, 92/218 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/567 variables, 210/428 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/567 variables, 374/802 constraints. Problems are: Problem set: 221 solved, 374 unsolved
[2024-05-28 23:04:29] [INFO ] Deduced a trap composed of 45 places in 157 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/567 variables, 1/803 constraints. Problems are: Problem set: 221 solved, 374 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 567/567 variables, and 803 constraints, problems are : Problem set: 221 solved, 374 unsolved in 30015 ms.
Refiners :[Domain max(s): 92/92 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 92/92 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 374/595 constraints, Known Traps: 18/18 constraints]
After SMT, in 62184ms problems are : Problem set: 221 solved, 374 unsolved
Search for dead transitions found 221 dead transitions in 62192ms
Found 221 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 221 transitions
Dead transitions reduction (with SMT) removed 221 transitions
Starting structural reductions in LTL mode, iteration 1 : 92/92 places, 384/605 transitions.
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 90 transition count 382
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 88 transition count 380
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 86 transition count 378
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 8 place count 84 transition count 376
Applied a total of 8 rules in 4 ms. Remains 84 /92 variables (removed 8) and now considering 376/384 (removed 8) transitions.
[2024-05-28 23:04:32] [INFO ] Flow matrix only has 299 transitions (discarded 77 similar events)
// Phase 1: matrix 299 rows 84 cols
[2024-05-28 23:04:32] [INFO ] Computed 17 invariants in 3 ms
[2024-05-28 23:04:33] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-28 23:04:33] [INFO ] Flow matrix only has 299 transitions (discarded 77 similar events)
[2024-05-28 23:04:33] [INFO ] Invariant cache hit.
[2024-05-28 23:04:33] [INFO ] State equation strengthened by 122 read => feed constraints.
[2024-05-28 23:04:33] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 596 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 84/92 places, 376/605 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63986 ms. Remains : 84/92 places, 376/605 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 p1 p0), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 97 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 537 ms. (74 steps per ms) remains 2/4 properties
BEST_FIRST walk for 5683 steps (0 resets) in 97 ms. (57 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 6 factoid took 324 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 178 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 307 ms.
Product exploration explored 100000 steps with 0 reset in 373 ms.
Support contains 7 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 376/376 transitions.
Applied a total of 0 rules in 1 ms. Remains 84 /84 variables (removed 0) and now considering 376/376 (removed 0) transitions.
[2024-05-28 23:04:36] [INFO ] Flow matrix only has 299 transitions (discarded 77 similar events)
[2024-05-28 23:04:36] [INFO ] Invariant cache hit.
[2024-05-28 23:04:36] [INFO ] Implicit Places using invariants in 376 ms returned []
[2024-05-28 23:04:36] [INFO ] Flow matrix only has 299 transitions (discarded 77 similar events)
[2024-05-28 23:04:36] [INFO ] Invariant cache hit.
[2024-05-28 23:04:36] [INFO ] State equation strengthened by 122 read => feed constraints.
[2024-05-28 23:04:36] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 805 ms to find 0 implicit places.
Running 366 sub problems to find dead transitions.
[2024-05-28 23:04:36] [INFO ] Flow matrix only has 299 transitions (discarded 77 similar events)
[2024-05-28 23:04:36] [INFO ] Invariant cache hit.
[2024-05-28 23:04:36] [INFO ] State equation strengthened by 122 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 4/78 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-05-28 23:04:39] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-05-28 23:04:39] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 5 (OVERLAPS) 10/84 variables, 10/91 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 10/101 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-05-28 23:04:44] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 1 ms to minimize.
[2024-05-28 23:04:44] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 1 ms to minimize.
[2024-05-28 23:04:44] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 1 ms to minimize.
[2024-05-28 23:04:44] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
[2024-05-28 23:04:45] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 2 ms to minimize.
[2024-05-28 23:04:45] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 6/109 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-05-28 23:04:46] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 1 ms to minimize.
[2024-05-28 23:04:46] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/84 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-05-28 23:04:48] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 1 ms to minimize.
[2024-05-28 23:04:49] [INFO ] Deduced a trap composed of 49 places in 105 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/84 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/84 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 12 (OVERLAPS) 299/383 variables, 84/197 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/383 variables, 122/319 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/383 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 15 (OVERLAPS) 0/383 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 366 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 319 constraints, problems are : Problem set: 0 solved, 366 unsolved in 29951 ms.
Refiners :[Domain max(s): 84/84 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 84/84 constraints, ReadFeed: 122/122 constraints, PredecessorRefiner: 366/366 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 366 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 4/78 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 10/89 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 5 (OVERLAPS) 10/84 variables, 10/99 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 10/109 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/84 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 10 (OVERLAPS) 299/383 variables, 84/197 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 122/319 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/383 variables, 366/685 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/383 variables, 0/685 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 383/383 variables, and 685 constraints, problems are : Problem set: 0 solved, 366 unsolved in 30019 ms.
Refiners :[Domain max(s): 84/84 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 84/84 constraints, ReadFeed: 122/122 constraints, PredecessorRefiner: 366/366 constraints, Known Traps: 12/12 constraints]
After SMT, in 60791ms problems are : Problem set: 0 solved, 366 unsolved
Search for dead transitions found 0 dead transitions in 60796ms
Finished structural reductions in LTL mode , in 1 iterations and 61604 ms. Remains : 84/84 places, 376/376 transitions.
Treatment of property SimpleLoadBal-PT-10-LTLFireability-06 finished in 130553 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((G(F(p1))||(!p2 U p3)))||p0)))'
Support contains 12 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 605/605 transitions.
Applied a total of 0 rules in 2 ms. Remains 93 /93 variables (removed 0) and now considering 605/605 (removed 0) transitions.
[2024-05-28 23:05:37] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
// Phase 1: matrix 475 rows 93 cols
[2024-05-28 23:05:37] [INFO ] Computed 18 invariants in 4 ms
[2024-05-28 23:05:38] [INFO ] Implicit Places using invariants in 208 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 211 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 92/93 places, 605/605 transitions.
Applied a total of 0 rules in 2 ms. Remains 92 /92 variables (removed 0) and now considering 605/605 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 215 ms. Remains : 92/93 places, 605/605 transitions.
Stuttering acceptance computed with spot in 277 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : SimpleLoadBal-PT-10-LTLFireability-08
Product exploration explored 100000 steps with 50000 reset in 234 ms.
Product exploration explored 100000 steps with 50000 reset in 284 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p3 (NOT p2) (NOT p1)), (X p0), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 19 ms. Reduced automaton from 6 states, 11 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SimpleLoadBal-PT-10-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SimpleLoadBal-PT-10-LTLFireability-08 finished in 1062 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||F(p1))))'
Support contains 7 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 605/605 transitions.
Applied a total of 0 rules in 2 ms. Remains 93 /93 variables (removed 0) and now considering 605/605 (removed 0) transitions.
[2024-05-28 23:05:38] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
[2024-05-28 23:05:38] [INFO ] Invariant cache hit.
[2024-05-28 23:05:39] [INFO ] Implicit Places using invariants in 202 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 205 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 92/93 places, 605/605 transitions.
Applied a total of 0 rules in 3 ms. Remains 92 /92 variables (removed 0) and now considering 605/605 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 210 ms. Remains : 92/93 places, 605/605 transitions.
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : SimpleLoadBal-PT-10-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 138 ms.
Product exploration explored 100000 steps with 50000 reset in 158 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 96 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SimpleLoadBal-PT-10-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SimpleLoadBal-PT-10-LTLFireability-12 finished in 737 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 U p1) U (F(p2)||G(p0))))))'
Support contains 9 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 605/605 transitions.
Applied a total of 0 rules in 3 ms. Remains 93 /93 variables (removed 0) and now considering 605/605 (removed 0) transitions.
[2024-05-28 23:05:39] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
[2024-05-28 23:05:39] [INFO ] Invariant cache hit.
[2024-05-28 23:05:39] [INFO ] Implicit Places using invariants in 207 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 210 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 92/93 places, 605/605 transitions.
Applied a total of 0 rules in 2 ms. Remains 92 /92 variables (removed 0) and now considering 605/605 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 215 ms. Remains : 92/93 places, 605/605 transitions.
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : SimpleLoadBal-PT-10-LTLFireability-13
Product exploration explored 100000 steps with 115 reset in 363 ms.
Stack based approach found an accepted trace after 1625 steps with 0 reset with depth 1626 and stack size 1626 in 7 ms.
FORMULA SimpleLoadBal-PT-10-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property SimpleLoadBal-PT-10-LTLFireability-13 finished in 767 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((p1 U X(((G(p2) U p1)||X(p1)))))))'
Support contains 11 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 605/605 transitions.
Applied a total of 0 rules in 2 ms. Remains 93 /93 variables (removed 0) and now considering 605/605 (removed 0) transitions.
[2024-05-28 23:05:40] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
[2024-05-28 23:05:40] [INFO ] Invariant cache hit.
[2024-05-28 23:05:40] [INFO ] Implicit Places using invariants in 203 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 204 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 92/93 places, 605/605 transitions.
Applied a total of 0 rules in 2 ms. Remains 92 /92 variables (removed 0) and now considering 605/605 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 208 ms. Remains : 92/93 places, 605/605 transitions.
Stuttering acceptance computed with spot in 370 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p2)]
Running random walk in product with property : SimpleLoadBal-PT-10-LTLFireability-14
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA SimpleLoadBal-PT-10-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SimpleLoadBal-PT-10-LTLFireability-14 finished in 602 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p1)||p0))))'
Found a Lengthening insensitive property : SimpleLoadBal-PT-10-LTLFireability-06
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 7 out of 93 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 93/93 places, 605/605 transitions.
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 0 place count 93 transition count 594
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 82 transition count 594
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 71 transition count 583
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 47 place count 69 transition count 582
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 49 place count 68 transition count 581
Applied a total of 49 rules in 27 ms. Remains 68 /93 variables (removed 25) and now considering 581/605 (removed 24) transitions.
[2024-05-28 23:05:41] [INFO ] Flow matrix only has 451 transitions (discarded 130 similar events)
// Phase 1: matrix 451 rows 68 cols
[2024-05-28 23:05:41] [INFO ] Computed 17 invariants in 4 ms
[2024-05-28 23:05:41] [INFO ] Implicit Places using invariants in 208 ms returned []
[2024-05-28 23:05:41] [INFO ] Flow matrix only has 451 transitions (discarded 130 similar events)
[2024-05-28 23:05:41] [INFO ] Invariant cache hit.
[2024-05-28 23:05:41] [INFO ] State equation strengthened by 210 read => feed constraints.
[2024-05-28 23:05:42] [INFO ] Implicit Places using invariants and state equation in 624 ms returned []
Implicit Place search using SMT with State Equation took 834 ms to find 0 implicit places.
Running 571 sub problems to find dead transitions.
[2024-05-28 23:05:42] [INFO ] Flow matrix only has 451 transitions (discarded 130 similar events)
[2024-05-28 23:05:42] [INFO ] Invariant cache hit.
[2024-05-28 23:05:42] [INFO ] State equation strengthened by 210 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 4 (OVERLAPS) 9/67 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 9/81 constraints. Problems are: Problem set: 0 solved, 571 unsolved
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 2/83 constraints. Problems are: Problem set: 178 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/83 constraints. Problems are: Problem set: 178 solved, 393 unsolved
Problem TDEAD13 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
At refinement iteration 8 (OVERLAPS) 1/68 variables, 1/84 constraints. Problems are: Problem set: 192 solved, 379 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/68 variables, 1/85 constraints. Problems are: Problem set: 192 solved, 379 unsolved
[2024-05-28 23:05:54] [INFO ] Deduced a trap composed of 26 places in 147 ms of which 3 ms to minimize.
Problem TDEAD319 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
[2024-05-28 23:05:54] [INFO ] Deduced a trap composed of 33 places in 126 ms of which 1 ms to minimize.
[2024-05-28 23:05:55] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 1 ms to minimize.
[2024-05-28 23:05:55] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 1 ms to minimize.
Problem TDEAD547 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD551 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/68 variables, 4/89 constraints. Problems are: Problem set: 216 solved, 355 unsolved
[2024-05-28 23:05:56] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 1 ms to minimize.
[2024-05-28 23:05:56] [INFO ] Deduced a trap composed of 14 places in 151 ms of which 2 ms to minimize.
[2024-05-28 23:05:57] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 1 ms to minimize.
[2024-05-28 23:05:57] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 1 ms to minimize.
[2024-05-28 23:05:57] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 2 ms to minimize.
Problem TDEAD574 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD546 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/68 variables, 5/94 constraints. Problems are: Problem set: 221 solved, 350 unsolved
[2024-05-28 23:05:58] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 1 ms to minimize.
[2024-05-28 23:05:59] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 1 ms to minimize.
[2024-05-28 23:05:59] [INFO ] Deduced a trap composed of 17 places in 151 ms of which 1 ms to minimize.
[2024-05-28 23:05:59] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 1 ms to minimize.
[2024-05-28 23:05:59] [INFO ] Deduced a trap composed of 14 places in 163 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/68 variables, 5/99 constraints. Problems are: Problem set: 221 solved, 350 unsolved
[2024-05-28 23:06:02] [INFO ] Deduced a trap composed of 32 places in 152 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/68 variables, 1/100 constraints. Problems are: Problem set: 221 solved, 350 unsolved
[2024-05-28 23:06:03] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/68 variables, 1/101 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/68 variables, 0/101 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 16 (OVERLAPS) 451/519 variables, 68/169 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/519 variables, 210/379 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/519 variables, 0/379 constraints. Problems are: Problem set: 221 solved, 350 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 519/519 variables, and 379 constraints, problems are : Problem set: 221 solved, 350 unsolved in 30022 ms.
Refiners :[Domain max(s): 68/68 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 68/68 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 571/571 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 221 solved, 350 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 4/62 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/63 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 12/75 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/75 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 5 (OVERLAPS) 9/67 variables, 9/84 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 9/93 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 2/95 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 0/95 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 9 (OVERLAPS) 1/68 variables, 1/96 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/68 variables, 1/97 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/68 variables, 4/101 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/68 variables, 0/101 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 13 (OVERLAPS) 451/519 variables, 68/169 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/519 variables, 210/379 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/519 variables, 350/729 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/519 variables, 0/729 constraints. Problems are: Problem set: 221 solved, 350 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 519/519 variables, and 729 constraints, problems are : Problem set: 221 solved, 350 unsolved in 30014 ms.
Refiners :[Domain max(s): 68/68 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 68/68 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 350/571 constraints, Known Traps: 16/16 constraints]
After SMT, in 62131ms problems are : Problem set: 221 solved, 350 unsolved
Search for dead transitions found 221 dead transitions in 62139ms
Found 221 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 221 transitions
Dead transitions reduction (with SMT) removed 221 transitions
Starting structural reductions in LI_LTL mode, iteration 1 : 68/93 places, 360/605 transitions.
Reduce places removed 2 places and 2 transitions.
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 64 transition count 356
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 62 transition count 354
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 60 transition count 352
Applied a total of 6 rules in 13 ms. Remains 60 /68 variables (removed 8) and now considering 352/360 (removed 8) transitions.
[2024-05-28 23:06:44] [INFO ] Flow matrix only has 275 transitions (discarded 77 similar events)
// Phase 1: matrix 275 rows 60 cols
[2024-05-28 23:06:44] [INFO ] Computed 17 invariants in 2 ms
[2024-05-28 23:06:44] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-28 23:06:44] [INFO ] Flow matrix only has 275 transitions (discarded 77 similar events)
[2024-05-28 23:06:44] [INFO ] Invariant cache hit.
[2024-05-28 23:06:44] [INFO ] State equation strengthened by 122 read => feed constraints.
[2024-05-28 23:06:44] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 549 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 60/93 places, 352/605 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 63565 ms. Remains : 60/93 places, 352/605 transitions.
Running random walk in product with property : SimpleLoadBal-PT-10-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 450 ms.
Product exploration explored 100000 steps with 0 reset in 493 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 97 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 28674 steps (7 resets) in 218 ms. (130 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 6 factoid took 198 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 7 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 352/352 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 352/352 (removed 0) transitions.
[2024-05-28 23:06:46] [INFO ] Flow matrix only has 275 transitions (discarded 77 similar events)
[2024-05-28 23:06:46] [INFO ] Invariant cache hit.
[2024-05-28 23:06:46] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-05-28 23:06:46] [INFO ] Flow matrix only has 275 transitions (discarded 77 similar events)
[2024-05-28 23:06:46] [INFO ] Invariant cache hit.
[2024-05-28 23:06:46] [INFO ] State equation strengthened by 122 read => feed constraints.
[2024-05-28 23:06:46] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
Running 342 sub problems to find dead transitions.
[2024-05-28 23:06:47] [INFO ] Flow matrix only has 275 transitions (discarded 77 similar events)
[2024-05-28 23:06:47] [INFO ] Invariant cache hit.
[2024-05-28 23:06:47] [INFO ] State equation strengthened by 122 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 4/54 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 342 unsolved
[2024-05-28 23:06:49] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-28 23:06:50] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2024-05-28 23:06:50] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 1 ms to minimize.
[2024-05-28 23:06:50] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-05-28 23:06:50] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 342 unsolved
[2024-05-28 23:06:51] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 1 ms to minimize.
[2024-05-28 23:06:51] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 6 (OVERLAPS) 10/60 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 10/82 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 342 unsolved
[2024-05-28 23:06:55] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/60 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/60 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 11 (OVERLAPS) 275/335 variables, 60/145 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/335 variables, 122/267 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/335 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 14 (OVERLAPS) 0/335 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 342 unsolved
No progress, stopping.
After SMT solving in domain Real declared 335/335 variables, and 267 constraints, problems are : Problem set: 0 solved, 342 unsolved in 18360 ms.
Refiners :[Domain max(s): 60/60 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 122/122 constraints, PredecessorRefiner: 342/342 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 342 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 4/54 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 5 (OVERLAPS) 10/60 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 10/82 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/60 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 10 (OVERLAPS) 275/335 variables, 60/145 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/335 variables, 122/267 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/335 variables, 342/609 constraints. Problems are: Problem set: 0 solved, 342 unsolved
[2024-05-28 23:07:19] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 2 ms to minimize.
[2024-05-28 23:07:20] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/335 variables, 2/611 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/335 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 342 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 335/335 variables, and 611 constraints, problems are : Problem set: 0 solved, 342 unsolved in 30016 ms.
Refiners :[Domain max(s): 60/60 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 122/122 constraints, PredecessorRefiner: 342/342 constraints, Known Traps: 10/10 constraints]
After SMT, in 49261ms problems are : Problem set: 0 solved, 342 unsolved
Search for dead transitions found 0 dead transitions in 49266ms
Finished structural reductions in LTL mode , in 1 iterations and 49733 ms. Remains : 60/60 places, 352/352 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 p1 p0), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 93 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 26455 steps (6 resets) in 283 ms. (93 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 6 factoid took 197 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 417 ms.
Product exploration explored 100000 steps with 0 reset in 462 ms.
Support contains 7 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 352/352 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 352/352 (removed 0) transitions.
[2024-05-28 23:07:38] [INFO ] Flow matrix only has 275 transitions (discarded 77 similar events)
[2024-05-28 23:07:38] [INFO ] Invariant cache hit.
[2024-05-28 23:07:38] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-28 23:07:38] [INFO ] Flow matrix only has 275 transitions (discarded 77 similar events)
[2024-05-28 23:07:38] [INFO ] Invariant cache hit.
[2024-05-28 23:07:38] [INFO ] State equation strengthened by 122 read => feed constraints.
[2024-05-28 23:07:38] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
Running 342 sub problems to find dead transitions.
[2024-05-28 23:07:38] [INFO ] Flow matrix only has 275 transitions (discarded 77 similar events)
[2024-05-28 23:07:38] [INFO ] Invariant cache hit.
[2024-05-28 23:07:38] [INFO ] State equation strengthened by 122 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 4/54 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 342 unsolved
[2024-05-28 23:07:41] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-05-28 23:07:41] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-05-28 23:07:41] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2024-05-28 23:07:41] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2024-05-28 23:07:41] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 342 unsolved
[2024-05-28 23:07:43] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 1 ms to minimize.
[2024-05-28 23:07:43] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 6 (OVERLAPS) 10/60 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 10/82 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 342 unsolved
[2024-05-28 23:07:46] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/60 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/60 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 11 (OVERLAPS) 275/335 variables, 60/145 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/335 variables, 122/267 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/335 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 14 (OVERLAPS) 0/335 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 342 unsolved
No progress, stopping.
After SMT solving in domain Real declared 335/335 variables, and 267 constraints, problems are : Problem set: 0 solved, 342 unsolved in 18398 ms.
Refiners :[Domain max(s): 60/60 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 122/122 constraints, PredecessorRefiner: 342/342 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 342 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 4/54 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 5 (OVERLAPS) 10/60 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 10/82 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/60 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 10 (OVERLAPS) 275/335 variables, 60/145 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/335 variables, 122/267 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/335 variables, 342/609 constraints. Problems are: Problem set: 0 solved, 342 unsolved
[2024-05-28 23:08:12] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 1 ms to minimize.
[2024-05-28 23:08:13] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/335 variables, 2/611 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/335 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 342 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 335/335 variables, and 611 constraints, problems are : Problem set: 0 solved, 342 unsolved in 30014 ms.
Refiners :[Domain max(s): 60/60 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 122/122 constraints, PredecessorRefiner: 342/342 constraints, Known Traps: 10/10 constraints]
After SMT, in 49289ms problems are : Problem set: 0 solved, 342 unsolved
Search for dead transitions found 0 dead transitions in 49293ms
Finished structural reductions in LTL mode , in 1 iterations and 49725 ms. Remains : 60/60 places, 352/352 transitions.
Treatment of property SimpleLoadBal-PT-10-LTLFireability-06 finished in 167006 ms.
[2024-05-28 23:08:28] [INFO ] Flatten gal took : 68 ms
[2024-05-28 23:08:28] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-05-28 23:08:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 93 places, 605 transitions and 4126 arcs took 14 ms.
Total runtime 436676 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running SimpleLoadBal-PT-10

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 1472
MODEL NAME: /home/mcc/execution/412/model
93 places, 605 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA SimpleLoadBal-PT-10-LTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716937728691

--------------------
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="SimpleLoadBal-PT-10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is SimpleLoadBal-PT-10, 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 r377-smll-171683809800164"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SimpleLoadBal-PT-10.tgz
mv SimpleLoadBal-PT-10 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 ;