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.r378-smll-171683810900155.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 itstools
Input is SimpleLoadBal-PT-05, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r378-smll-171683810900155
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 768K
-rw-r--r-- 1 mcc users 8.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K 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 5.7K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K Apr 13 12:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 196K Apr 13 12:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 13 12:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 107K Apr 13 12:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K 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 155K 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-05-LTLCardinality-00
FORMULA_NAME SimpleLoadBal-PT-05-LTLCardinality-01
FORMULA_NAME SimpleLoadBal-PT-05-LTLCardinality-02
FORMULA_NAME SimpleLoadBal-PT-05-LTLCardinality-03
FORMULA_NAME SimpleLoadBal-PT-05-LTLCardinality-04
FORMULA_NAME SimpleLoadBal-PT-05-LTLCardinality-05
FORMULA_NAME SimpleLoadBal-PT-05-LTLCardinality-06
FORMULA_NAME SimpleLoadBal-PT-05-LTLCardinality-07
FORMULA_NAME SimpleLoadBal-PT-05-LTLCardinality-08
FORMULA_NAME SimpleLoadBal-PT-05-LTLCardinality-09
FORMULA_NAME SimpleLoadBal-PT-05-LTLCardinality-10
FORMULA_NAME SimpleLoadBal-PT-05-LTLCardinality-11
FORMULA_NAME SimpleLoadBal-PT-05-LTLCardinality-12
FORMULA_NAME SimpleLoadBal-PT-05-LTLCardinality-13
FORMULA_NAME SimpleLoadBal-PT-05-LTLCardinality-14
FORMULA_NAME SimpleLoadBal-PT-05-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716958367148

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SimpleLoadBal-PT-05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-29 04:52:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 04:52:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 04:52:50] [INFO ] Load time of PNML (sax parser for PT used): 291 ms
[2024-05-29 04:52:50] [INFO ] Transformed 59 places.
[2024-05-29 04:52:50] [INFO ] Transformed 180 transitions.
[2024-05-29 04:52:50] [INFO ] Found NUPN structural information;
[2024-05-29 04:52:50] [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_waiting_1, P_client_waiting_2, P_client_waiting_3, P_client_waiting_4, P_client_waiting_5, P_client_request_1, P_client_request_2, P_client_request_3, P_client_request_4, P_client_request_5, P_client_ack_1, P_client_ack_2, P_client_ack_3, P_client_ack_4, P_client_ack_5, 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_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_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_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]
[2024-05-29 04:52:50] [INFO ] Parsed PT model containing 59 places and 180 transitions and 1158 arcs in 523 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Initial state reduction rules removed 2 formulas.
FORMULA SimpleLoadBal-PT-05-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-05-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-05-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-05-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-05-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-05-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-05-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-05-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 59 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 59/59 places, 180/180 transitions.
Applied a total of 0 rules in 27 ms. Remains 59 /59 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-29 04:52:50] [INFO ] Flow matrix only has 140 transitions (discarded 40 similar events)
// Phase 1: matrix 140 rows 59 cols
[2024-05-29 04:52:50] [INFO ] Computed 19 invariants in 21 ms
[2024-05-29 04:52:51] [INFO ] Implicit Places using invariants in 563 ms returned [6, 8, 22, 23]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 634 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 55/59 places, 180/180 transitions.
Applied a total of 0 rules in 7 ms. Remains 55 /55 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 708 ms. Remains : 55/59 places, 180/180 transitions.
Support contains 25 out of 55 places after structural reductions.
[2024-05-29 04:52:51] [INFO ] Flatten gal took : 130 ms
[2024-05-29 04:52:51] [INFO ] Flatten gal took : 45 ms
[2024-05-29 04:52:51] [INFO ] Input system was already deterministic with 180 transitions.
Support contains 22 out of 55 places (down from 25) after GAL structural reductions.
RANDOM walk for 1095 steps (0 resets) in 193 ms. (5 steps per ms) remains 0/13 properties
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 55 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 55/55 places, 180/180 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 55 transition count 177
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 52 transition count 177
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 49 transition count 174
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 18 place count 45 transition count 172
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 43 transition count 170
Applied a total of 22 rules in 95 ms. Remains 43 /55 variables (removed 12) and now considering 170/180 (removed 10) transitions.
[2024-05-29 04:52:52] [INFO ] Flow matrix only has 130 transitions (discarded 40 similar events)
// Phase 1: matrix 130 rows 43 cols
[2024-05-29 04:52:52] [INFO ] Computed 13 invariants in 9 ms
[2024-05-29 04:52:52] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-29 04:52:52] [INFO ] Flow matrix only has 130 transitions (discarded 40 similar events)
[2024-05-29 04:52:52] [INFO ] Invariant cache hit.
[2024-05-29 04:52:52] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-29 04:52:52] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
[2024-05-29 04:52:52] [INFO ] Redundant transitions in 6 ms returned []
Running 165 sub problems to find dead transitions.
[2024-05-29 04:52:52] [INFO ] Flow matrix only has 130 transitions (discarded 40 similar events)
[2024-05-29 04:52:52] [INFO ] Invariant cache hit.
[2024-05-29 04:52:52] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-29 04:52:54] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 10 ms to minimize.
Problem TDEAD102 is UNSAT
[2024-05-29 04:52:54] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 3 ms to minimize.
[2024-05-29 04:52:55] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 2 ms to minimize.
[2024-05-29 04:52:55] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 4/48 constraints. Problems are: Problem set: 1 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/48 constraints. Problems are: Problem set: 1 solved, 164 unsolved
At refinement iteration 5 (OVERLAPS) 4/42 variables, 5/53 constraints. Problems are: Problem set: 1 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 4/57 constraints. Problems are: Problem set: 1 solved, 164 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 1/58 constraints. Problems are: Problem set: 17 solved, 148 unsolved
[2024-05-29 04:52:56] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2024-05-29 04:52:56] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-29 04:52:56] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-29 04:52:56] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-29 04:52:56] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
Problem TDEAD152 is UNSAT
Problem TDEAD165 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/42 variables, 5/63 constraints. Problems are: Problem set: 19 solved, 146 unsolved
[2024-05-29 04:52:57] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/42 variables, 1/64 constraints. Problems are: Problem set: 19 solved, 146 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/42 variables, 0/64 constraints. Problems are: Problem set: 19 solved, 146 unsolved
Problem TDEAD19 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
At refinement iteration 11 (OVERLAPS) 1/43 variables, 1/65 constraints. Problems are: Problem set: 41 solved, 124 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/43 variables, 1/66 constraints. Problems are: Problem set: 41 solved, 124 unsolved
[2024-05-29 04:52:58] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 2 ms to minimize.
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
[2024-05-29 04:52:58] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-29 04:52:58] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 1 ms to minimize.
Problem TDEAD164 is UNSAT
At refinement iteration 13 (INCLUDED_ONLY) 0/43 variables, 3/69 constraints. Problems are: Problem set: 44 solved, 121 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/43 variables, 0/69 constraints. Problems are: Problem set: 44 solved, 121 unsolved
At refinement iteration 15 (OVERLAPS) 130/173 variables, 43/112 constraints. Problems are: Problem set: 44 solved, 121 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/173 variables, 55/167 constraints. Problems are: Problem set: 44 solved, 121 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/173 variables, 0/167 constraints. Problems are: Problem set: 44 solved, 121 unsolved
At refinement iteration 18 (OVERLAPS) 0/173 variables, 0/167 constraints. Problems are: Problem set: 44 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 173/173 variables, and 167 constraints, problems are : Problem set: 44 solved, 121 unsolved in 9697 ms.
Refiners :[Domain max(s): 43/43 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 43/43 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 44 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 38/38 constraints. Problems are: Problem set: 44 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 5/43 constraints. Problems are: Problem set: 44 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 1/44 constraints. Problems are: Problem set: 44 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 7/51 constraints. Problems are: Problem set: 44 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/51 constraints. Problems are: Problem set: 44 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 4/42 variables, 5/56 constraints. Problems are: Problem set: 44 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 4/60 constraints. Problems are: Problem set: 44 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 1/61 constraints. Problems are: Problem set: 44 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/42 variables, 3/64 constraints. Problems are: Problem set: 44 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/42 variables, 0/64 constraints. Problems are: Problem set: 44 solved, 121 unsolved
At refinement iteration 10 (OVERLAPS) 1/43 variables, 1/65 constraints. Problems are: Problem set: 44 solved, 121 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/43 variables, 1/66 constraints. Problems are: Problem set: 44 solved, 121 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/43 variables, 3/69 constraints. Problems are: Problem set: 44 solved, 121 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/43 variables, 0/69 constraints. Problems are: Problem set: 44 solved, 121 unsolved
At refinement iteration 14 (OVERLAPS) 130/173 variables, 43/112 constraints. Problems are: Problem set: 44 solved, 121 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/173 variables, 55/167 constraints. Problems are: Problem set: 44 solved, 121 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/173 variables, 121/288 constraints. Problems are: Problem set: 44 solved, 121 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/173 variables, 0/288 constraints. Problems are: Problem set: 44 solved, 121 unsolved
At refinement iteration 18 (OVERLAPS) 0/173 variables, 0/288 constraints. Problems are: Problem set: 44 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 173/173 variables, and 288 constraints, problems are : Problem set: 44 solved, 121 unsolved in 7943 ms.
Refiners :[Domain max(s): 43/43 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 43/43 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 121/165 constraints, Known Traps: 13/13 constraints]
After SMT, in 18436ms problems are : Problem set: 44 solved, 121 unsolved
Search for dead transitions found 44 dead transitions in 18461ms
Found 44 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 44 transitions
Dead transitions reduction (with SMT) removed 44 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 43/55 places, 126/180 transitions.
Reduce places removed 2 places and 2 transitions.
Reduce places removed 1 places and 6 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 40 transition count 118
Applied a total of 1 rules in 10 ms. Remains 40 /43 variables (removed 3) and now considering 118/126 (removed 8) transitions.
[2024-05-29 04:53:11] [INFO ] Flow matrix only has 94 transitions (discarded 24 similar events)
// Phase 1: matrix 94 rows 40 cols
[2024-05-29 04:53:11] [INFO ] Computed 13 invariants in 2 ms
[2024-05-29 04:53:11] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-29 04:53:11] [INFO ] Flow matrix only has 94 transitions (discarded 24 similar events)
[2024-05-29 04:53:11] [INFO ] Invariant cache hit.
[2024-05-29 04:53:11] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-29 04:53:11] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 40/55 places, 118/180 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 19392 ms. Remains : 40/55 places, 118/180 transitions.
Stuttering acceptance computed with spot in 234 ms :[(NOT p0)]
Running random walk in product with property : SimpleLoadBal-PT-05-LTLCardinality-01
Product exploration explored 100000 steps with 0 reset in 639 ms.
Stack based approach found an accepted trace after 70 steps with 0 reset with depth 71 and stack size 71 in 1 ms.
FORMULA SimpleLoadBal-PT-05-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property SimpleLoadBal-PT-05-LTLCardinality-01 finished in 20395 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X(X(X(p1)))))))'
Support contains 4 out of 55 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 55 /55 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-29 04:53:12] [INFO ] Flow matrix only has 140 transitions (discarded 40 similar events)
// Phase 1: matrix 140 rows 55 cols
[2024-05-29 04:53:12] [INFO ] Computed 15 invariants in 5 ms
[2024-05-29 04:53:12] [INFO ] Implicit Places using invariants in 143 ms returned [6, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 145 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 53/55 places, 180/180 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 148 ms. Remains : 53/55 places, 180/180 transitions.
Stuttering acceptance computed with spot in 279 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : SimpleLoadBal-PT-05-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA SimpleLoadBal-PT-05-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SimpleLoadBal-PT-05-LTLCardinality-04 finished in 460 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U p1)))'
Support contains 3 out of 55 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 55/55 places, 180/180 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 55 transition count 176
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 51 transition count 176
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 14 place count 48 transition count 173
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 23 place count 42 transition count 170
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 29 place count 39 transition count 167
Applied a total of 29 rules in 23 ms. Remains 39 /55 variables (removed 16) and now considering 167/180 (removed 13) transitions.
[2024-05-29 04:53:12] [INFO ] Flow matrix only has 127 transitions (discarded 40 similar events)
// Phase 1: matrix 127 rows 39 cols
[2024-05-29 04:53:12] [INFO ] Computed 12 invariants in 4 ms
[2024-05-29 04:53:13] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-29 04:53:13] [INFO ] Flow matrix only has 127 transitions (discarded 40 similar events)
[2024-05-29 04:53:13] [INFO ] Invariant cache hit.
[2024-05-29 04:53:13] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-29 04:53:13] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
[2024-05-29 04:53:13] [INFO ] Redundant transitions in 5 ms returned []
Running 162 sub problems to find dead transitions.
[2024-05-29 04:53:13] [INFO ] Flow matrix only has 127 transitions (discarded 40 similar events)
[2024-05-29 04:53:13] [INFO ] Invariant cache hit.
[2024-05-29 04:53:13] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 5/39 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-29 04:53:14] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
Problem TDEAD96 is UNSAT
[2024-05-29 04:53:14] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-29 04:53:14] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2024-05-29 04:53:14] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
[2024-05-29 04:53:15] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 1 ms to minimize.
[2024-05-29 04:53:15] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 6/46 constraints. Problems are: Problem set: 1 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/46 constraints. Problems are: Problem set: 1 solved, 161 unsolved
At refinement iteration 5 (OVERLAPS) 3/37 variables, 3/49 constraints. Problems are: Problem set: 1 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 3/52 constraints. Problems are: Problem set: 1 solved, 161 unsolved
Problem TDEAD35 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD80 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 1/53 constraints. Problems are: Problem set: 7 solved, 155 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 0/53 constraints. Problems are: Problem set: 7 solved, 155 unsolved
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD147 is UNSAT
At refinement iteration 9 (OVERLAPS) 2/39 variables, 2/55 constraints. Problems are: Problem set: 40 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/39 variables, 2/57 constraints. Problems are: Problem set: 40 solved, 122 unsolved
[2024-05-29 04:53:17] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 1 ms to minimize.
[2024-05-29 04:53:17] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
[2024-05-29 04:53:17] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 2 ms to minimize.
[2024-05-29 04:53:17] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 2 ms to minimize.
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/39 variables, 4/61 constraints. Problems are: Problem set: 44 solved, 118 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/39 variables, 0/61 constraints. Problems are: Problem set: 44 solved, 118 unsolved
At refinement iteration 13 (OVERLAPS) 127/166 variables, 39/100 constraints. Problems are: Problem set: 44 solved, 118 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/166 variables, 55/155 constraints. Problems are: Problem set: 44 solved, 118 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/166 variables, 0/155 constraints. Problems are: Problem set: 44 solved, 118 unsolved
At refinement iteration 16 (OVERLAPS) 0/166 variables, 0/155 constraints. Problems are: Problem set: 44 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 166/166 variables, and 155 constraints, problems are : Problem set: 44 solved, 118 unsolved in 7415 ms.
Refiners :[Domain max(s): 39/39 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 39/39 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 44 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 34/34 constraints. Problems are: Problem set: 44 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 5/39 constraints. Problems are: Problem set: 44 solved, 118 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 1/40 constraints. Problems are: Problem set: 44 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 7/47 constraints. Problems are: Problem set: 44 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/47 constraints. Problems are: Problem set: 44 solved, 118 unsolved
At refinement iteration 5 (OVERLAPS) 3/37 variables, 3/50 constraints. Problems are: Problem set: 44 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 3/53 constraints. Problems are: Problem set: 44 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 1/54 constraints. Problems are: Problem set: 44 solved, 118 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 0/54 constraints. Problems are: Problem set: 44 solved, 118 unsolved
At refinement iteration 9 (OVERLAPS) 2/39 variables, 2/56 constraints. Problems are: Problem set: 44 solved, 118 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/39 variables, 2/58 constraints. Problems are: Problem set: 44 solved, 118 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/39 variables, 3/61 constraints. Problems are: Problem set: 44 solved, 118 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/39 variables, 0/61 constraints. Problems are: Problem set: 44 solved, 118 unsolved
At refinement iteration 13 (OVERLAPS) 127/166 variables, 39/100 constraints. Problems are: Problem set: 44 solved, 118 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/166 variables, 55/155 constraints. Problems are: Problem set: 44 solved, 118 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/166 variables, 118/273 constraints. Problems are: Problem set: 44 solved, 118 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/166 variables, 0/273 constraints. Problems are: Problem set: 44 solved, 118 unsolved
At refinement iteration 17 (OVERLAPS) 0/166 variables, 0/273 constraints. Problems are: Problem set: 44 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 166/166 variables, and 273 constraints, problems are : Problem set: 44 solved, 118 unsolved in 7409 ms.
Refiners :[Domain max(s): 39/39 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 39/39 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 118/162 constraints, Known Traps: 10/10 constraints]
After SMT, in 15150ms problems are : Problem set: 44 solved, 118 unsolved
Search for dead transitions found 44 dead transitions in 15154ms
Found 44 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 44 transitions
Dead transitions reduction (with SMT) removed 44 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 39/55 places, 123/180 transitions.
Reduce places removed 2 places and 2 transitions.
Reduce places removed 1 places and 6 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 36 transition count 115
Applied a total of 1 rules in 8 ms. Remains 36 /39 variables (removed 3) and now considering 115/123 (removed 8) transitions.
[2024-05-29 04:53:28] [INFO ] Flow matrix only has 91 transitions (discarded 24 similar events)
// Phase 1: matrix 91 rows 36 cols
[2024-05-29 04:53:28] [INFO ] Computed 12 invariants in 1 ms
[2024-05-29 04:53:28] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-29 04:53:28] [INFO ] Flow matrix only has 91 transitions (discarded 24 similar events)
[2024-05-29 04:53:28] [INFO ] Invariant cache hit.
[2024-05-29 04:53:28] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-29 04:53:28] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 36/55 places, 115/180 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 15780 ms. Remains : 36/55 places, 115/180 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : SimpleLoadBal-PT-05-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA SimpleLoadBal-PT-05-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SimpleLoadBal-PT-05-LTLCardinality-05 finished in 15904 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(p1)))'
Support contains 4 out of 55 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 55/55 places, 180/180 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 55 transition count 176
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 51 transition count 176
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 47 transition count 172
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 25 place count 41 transition count 169
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 31 place count 38 transition count 166
Applied a total of 31 rules in 23 ms. Remains 38 /55 variables (removed 17) and now considering 166/180 (removed 14) transitions.
[2024-05-29 04:53:28] [INFO ] Flow matrix only has 126 transitions (discarded 40 similar events)
// Phase 1: matrix 126 rows 38 cols
[2024-05-29 04:53:28] [INFO ] Computed 12 invariants in 3 ms
[2024-05-29 04:53:28] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-29 04:53:28] [INFO ] Flow matrix only has 126 transitions (discarded 40 similar events)
[2024-05-29 04:53:28] [INFO ] Invariant cache hit.
[2024-05-29 04:53:29] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-29 04:53:29] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
[2024-05-29 04:53:29] [INFO ] Redundant transitions in 5 ms returned []
Running 161 sub problems to find dead transitions.
[2024-05-29 04:53:29] [INFO ] Flow matrix only has 126 transitions (discarded 40 similar events)
[2024-05-29 04:53:29] [INFO ] Invariant cache hit.
[2024-05-29 04:53:29] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-29 04:53:30] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 2 ms to minimize.
Problem TDEAD93 is UNSAT
[2024-05-29 04:53:30] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2024-05-29 04:53:30] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 2 ms to minimize.
[2024-05-29 04:53:30] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 4/43 constraints. Problems are: Problem set: 1 solved, 160 unsolved
[2024-05-29 04:53:31] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 1/44 constraints. Problems are: Problem set: 1 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/44 constraints. Problems are: Problem set: 1 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/47 constraints. Problems are: Problem set: 1 solved, 160 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 3/50 constraints. Problems are: Problem set: 1 solved, 160 unsolved
Problem TDEAD32 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD77 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 1/51 constraints. Problems are: Problem set: 7 solved, 154 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/36 variables, 0/51 constraints. Problems are: Problem set: 7 solved, 154 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD146 is UNSAT
At refinement iteration 10 (OVERLAPS) 2/38 variables, 2/53 constraints. Problems are: Problem set: 40 solved, 121 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/38 variables, 2/55 constraints. Problems are: Problem set: 40 solved, 121 unsolved
[2024-05-29 04:53:33] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
[2024-05-29 04:53:33] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-29 04:53:33] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 1 ms to minimize.
Problem TDEAD159 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/38 variables, 3/58 constraints. Problems are: Problem set: 43 solved, 118 unsolved
[2024-05-29 04:53:34] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/38 variables, 1/59 constraints. Problems are: Problem set: 43 solved, 118 unsolved
[2024-05-29 04:53:34] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
Problem TDEAD158 is UNSAT
At refinement iteration 14 (INCLUDED_ONLY) 0/38 variables, 1/60 constraints. Problems are: Problem set: 44 solved, 117 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/38 variables, 0/60 constraints. Problems are: Problem set: 44 solved, 117 unsolved
At refinement iteration 16 (OVERLAPS) 126/164 variables, 38/98 constraints. Problems are: Problem set: 44 solved, 117 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/164 variables, 55/153 constraints. Problems are: Problem set: 44 solved, 117 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/164 variables, 0/153 constraints. Problems are: Problem set: 44 solved, 117 unsolved
At refinement iteration 19 (OVERLAPS) 0/164 variables, 0/153 constraints. Problems are: Problem set: 44 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/164 variables, and 153 constraints, problems are : Problem set: 44 solved, 117 unsolved in 8764 ms.
Refiners :[Domain max(s): 38/38 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 38/38 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 44 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 33/33 constraints. Problems are: Problem set: 44 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 5/38 constraints. Problems are: Problem set: 44 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 1/39 constraints. Problems are: Problem set: 44 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 7/46 constraints. Problems are: Problem set: 44 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/46 constraints. Problems are: Problem set: 44 solved, 117 unsolved
At refinement iteration 5 (OVERLAPS) 3/36 variables, 3/49 constraints. Problems are: Problem set: 44 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 3/52 constraints. Problems are: Problem set: 44 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 1/53 constraints. Problems are: Problem set: 44 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/53 constraints. Problems are: Problem set: 44 solved, 117 unsolved
At refinement iteration 9 (OVERLAPS) 2/38 variables, 2/55 constraints. Problems are: Problem set: 44 solved, 117 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/38 variables, 2/57 constraints. Problems are: Problem set: 44 solved, 117 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/38 variables, 3/60 constraints. Problems are: Problem set: 44 solved, 117 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/38 variables, 0/60 constraints. Problems are: Problem set: 44 solved, 117 unsolved
At refinement iteration 13 (OVERLAPS) 126/164 variables, 38/98 constraints. Problems are: Problem set: 44 solved, 117 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/164 variables, 55/153 constraints. Problems are: Problem set: 44 solved, 117 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/164 variables, 117/270 constraints. Problems are: Problem set: 44 solved, 117 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/164 variables, 0/270 constraints. Problems are: Problem set: 44 solved, 117 unsolved
At refinement iteration 17 (OVERLAPS) 0/164 variables, 0/270 constraints. Problems are: Problem set: 44 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/164 variables, and 270 constraints, problems are : Problem set: 44 solved, 117 unsolved in 7787 ms.
Refiners :[Domain max(s): 38/38 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 38/38 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 117/161 constraints, Known Traps: 10/10 constraints]
After SMT, in 16811ms problems are : Problem set: 44 solved, 117 unsolved
Search for dead transitions found 44 dead transitions in 16814ms
Found 44 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 44 transitions
Dead transitions reduction (with SMT) removed 44 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 38/55 places, 122/180 transitions.
Reduce places removed 2 places and 2 transitions.
Reduce places removed 1 places and 6 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 35 transition count 114
Applied a total of 1 rules in 9 ms. Remains 35 /38 variables (removed 3) and now considering 114/122 (removed 8) transitions.
[2024-05-29 04:53:45] [INFO ] Flow matrix only has 90 transitions (discarded 24 similar events)
// Phase 1: matrix 90 rows 35 cols
[2024-05-29 04:53:45] [INFO ] Computed 12 invariants in 2 ms
[2024-05-29 04:53:46] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-29 04:53:46] [INFO ] Flow matrix only has 90 transitions (discarded 24 similar events)
[2024-05-29 04:53:46] [INFO ] Invariant cache hit.
[2024-05-29 04:53:46] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-29 04:53:46] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 35/55 places, 114/180 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 17440 ms. Remains : 35/55 places, 114/180 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : SimpleLoadBal-PT-05-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SimpleLoadBal-PT-05-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SimpleLoadBal-PT-05-LTLCardinality-07 finished in 17564 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((X(F(p0)) U G(p1)))))'
Support contains 4 out of 55 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 180/180 transitions.
Applied a total of 0 rules in 3 ms. Remains 55 /55 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-29 04:53:46] [INFO ] Flow matrix only has 140 transitions (discarded 40 similar events)
// Phase 1: matrix 140 rows 55 cols
[2024-05-29 04:53:46] [INFO ] Computed 15 invariants in 6 ms
[2024-05-29 04:53:46] [INFO ] Implicit Places using invariants in 165 ms returned [5, 6, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 167 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 52/55 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 52 /52 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 173 ms. Remains : 52/55 places, 180/180 transitions.
Stuttering acceptance computed with spot in 196 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : SimpleLoadBal-PT-05-LTLCardinality-08
Product exploration explored 100000 steps with 1430 reset in 442 ms.
Stack based approach found an accepted trace after 1898 steps with 29 reset with depth 196 and stack size 196 in 12 ms.
FORMULA SimpleLoadBal-PT-05-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property SimpleLoadBal-PT-05-LTLCardinality-08 finished in 851 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(X(p0)) U p1)))'
Support contains 2 out of 55 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 55/55 places, 180/180 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 55 transition count 177
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 52 transition count 177
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 49 transition count 174
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 21 place count 43 transition count 171
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 27 place count 40 transition count 168
Applied a total of 27 rules in 31 ms. Remains 40 /55 variables (removed 15) and now considering 168/180 (removed 12) transitions.
[2024-05-29 04:53:47] [INFO ] Flow matrix only has 128 transitions (discarded 40 similar events)
// Phase 1: matrix 128 rows 40 cols
[2024-05-29 04:53:47] [INFO ] Computed 12 invariants in 1 ms
[2024-05-29 04:53:47] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-29 04:53:47] [INFO ] Flow matrix only has 128 transitions (discarded 40 similar events)
[2024-05-29 04:53:47] [INFO ] Invariant cache hit.
[2024-05-29 04:53:47] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-29 04:53:47] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
[2024-05-29 04:53:47] [INFO ] Redundant transitions in 3 ms returned []
Running 163 sub problems to find dead transitions.
[2024-05-29 04:53:47] [INFO ] Flow matrix only has 128 transitions (discarded 40 similar events)
[2024-05-29 04:53:47] [INFO ] Invariant cache hit.
[2024-05-29 04:53:47] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (OVERLAPS) 4/39 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 163 unsolved
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
At refinement iteration 7 (OVERLAPS) 1/40 variables, 3/51 constraints. Problems are: Problem set: 39 solved, 124 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40 variables, 1/52 constraints. Problems are: Problem set: 39 solved, 124 unsolved
[2024-05-29 04:53:50] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 3 ms to minimize.
[2024-05-29 04:53:50] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 6 ms to minimize.
Problem TDEAD93 is UNSAT
[2024-05-29 04:53:50] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 2 ms to minimize.
Problem TDEAD94 is UNSAT
[2024-05-29 04:53:50] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 1 ms to minimize.
Problem TDEAD148 is UNSAT
[2024-05-29 04:53:50] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 2 ms to minimize.
[2024-05-29 04:53:51] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 1 ms to minimize.
[2024-05-29 04:53:51] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 3 ms to minimize.
[2024-05-29 04:53:51] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 1 ms to minimize.
Problem TDEAD161 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/40 variables, 8/60 constraints. Problems are: Problem set: 43 solved, 120 unsolved
[2024-05-29 04:53:51] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 1 ms to minimize.
[2024-05-29 04:53:51] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
Problem TDEAD160 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/40 variables, 2/62 constraints. Problems are: Problem set: 44 solved, 119 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/40 variables, 0/62 constraints. Problems are: Problem set: 44 solved, 119 unsolved
At refinement iteration 12 (OVERLAPS) 128/168 variables, 40/102 constraints. Problems are: Problem set: 44 solved, 119 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/168 variables, 55/157 constraints. Problems are: Problem set: 44 solved, 119 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/168 variables, 0/157 constraints. Problems are: Problem set: 44 solved, 119 unsolved
[2024-05-29 04:53:53] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/168 variables, 1/158 constraints. Problems are: Problem set: 44 solved, 119 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/168 variables, 0/158 constraints. Problems are: Problem set: 44 solved, 119 unsolved
At refinement iteration 17 (OVERLAPS) 0/168 variables, 0/158 constraints. Problems are: Problem set: 44 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 158 constraints, problems are : Problem set: 44 solved, 119 unsolved in 9091 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 40/40 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 44 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 35/35 constraints. Problems are: Problem set: 44 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 4/39 constraints. Problems are: Problem set: 44 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 1/40 constraints. Problems are: Problem set: 44 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 5/45 constraints. Problems are: Problem set: 44 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/45 constraints. Problems are: Problem set: 44 solved, 119 unsolved
At refinement iteration 5 (OVERLAPS) 4/39 variables, 4/49 constraints. Problems are: Problem set: 44 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 4/53 constraints. Problems are: Problem set: 44 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 1/54 constraints. Problems are: Problem set: 44 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/54 constraints. Problems are: Problem set: 44 solved, 119 unsolved
At refinement iteration 9 (OVERLAPS) 1/40 variables, 3/57 constraints. Problems are: Problem set: 44 solved, 119 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/40 variables, 1/58 constraints. Problems are: Problem set: 44 solved, 119 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/40 variables, 5/63 constraints. Problems are: Problem set: 44 solved, 119 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/40 variables, 0/63 constraints. Problems are: Problem set: 44 solved, 119 unsolved
At refinement iteration 13 (OVERLAPS) 128/168 variables, 40/103 constraints. Problems are: Problem set: 44 solved, 119 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/168 variables, 55/158 constraints. Problems are: Problem set: 44 solved, 119 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/168 variables, 119/277 constraints. Problems are: Problem set: 44 solved, 119 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/168 variables, 0/277 constraints. Problems are: Problem set: 44 solved, 119 unsolved
At refinement iteration 17 (OVERLAPS) 0/168 variables, 0/277 constraints. Problems are: Problem set: 44 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 277 constraints, problems are : Problem set: 44 solved, 119 unsolved in 7561 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 40/40 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 119/163 constraints, Known Traps: 11/11 constraints]
After SMT, in 16934ms problems are : Problem set: 44 solved, 119 unsolved
Search for dead transitions found 44 dead transitions in 16939ms
Found 44 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 44 transitions
Dead transitions reduction (with SMT) removed 44 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 40/55 places, 124/180 transitions.
Reduce places removed 2 places and 2 transitions.
Reduce places removed 1 places and 6 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 37 transition count 116
Applied a total of 1 rules in 7 ms. Remains 37 /40 variables (removed 3) and now considering 116/124 (removed 8) transitions.
[2024-05-29 04:54:04] [INFO ] Flow matrix only has 92 transitions (discarded 24 similar events)
// Phase 1: matrix 92 rows 37 cols
[2024-05-29 04:54:04] [INFO ] Computed 12 invariants in 1 ms
[2024-05-29 04:54:04] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-29 04:54:04] [INFO ] Flow matrix only has 92 transitions (discarded 24 similar events)
[2024-05-29 04:54:04] [INFO ] Invariant cache hit.
[2024-05-29 04:54:04] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-29 04:54:04] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 37/55 places, 116/180 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 17652 ms. Remains : 37/55 places, 116/180 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p1)]
Running random walk in product with property : SimpleLoadBal-PT-05-LTLCardinality-10
Product exploration explored 100000 steps with 24362 reset in 150 ms.
Product exploration explored 100000 steps with 24606 reset in 249 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 186 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p1)]
RANDOM walk for 9 steps (0 resets) in 6 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 1 factoid took 240 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p1)]
[2024-05-29 04:54:06] [INFO ] Flow matrix only has 92 transitions (discarded 24 similar events)
[2024-05-29 04:54:06] [INFO ] Invariant cache hit.
[2024-05-29 04:54:06] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2024-05-29 04:54:06] [INFO ] [Real]Absence check using 9 positive and 3 generalized place invariants in 6 ms returned sat
[2024-05-29 04:54:06] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-05-29 04:54:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 04:54:06] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-05-29 04:54:06] [INFO ] [Nat]Absence check using 9 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-29 04:54:06] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-05-29 04:54:06] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-29 04:54:06] [INFO ] [Nat]Added 37 Read/Feed constraints in 12 ms returned sat
[2024-05-29 04:54:06] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-29 04:54:06] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-29 04:54:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 114 ms
[2024-05-29 04:54:06] [INFO ] Computed and/alt/rep : 12/63/12 causal constraints (skipped 75 transitions) in 20 ms.
[2024-05-29 04:54:06] [INFO ] Added : 4 causal constraints over 2 iterations in 61 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 37 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 116/116 transitions.
Applied a total of 0 rules in 5 ms. Remains 37 /37 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2024-05-29 04:54:06] [INFO ] Flow matrix only has 92 transitions (discarded 24 similar events)
[2024-05-29 04:54:06] [INFO ] Invariant cache hit.
[2024-05-29 04:54:06] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-29 04:54:06] [INFO ] Flow matrix only has 92 transitions (discarded 24 similar events)
[2024-05-29 04:54:06] [INFO ] Invariant cache hit.
[2024-05-29 04:54:06] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-29 04:54:06] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2024-05-29 04:54:06] [INFO ] Redundant transitions in 1 ms returned []
Running 111 sub problems to find dead transitions.
[2024-05-29 04:54:06] [INFO ] Flow matrix only has 92 transitions (discarded 24 similar events)
[2024-05-29 04:54:06] [INFO ] Invariant cache hit.
[2024-05-29 04:54:06] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-05-29 04:54:07] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2024-05-29 04:54:07] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (OVERLAPS) 5/37 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-05-29 04:54:08] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (OVERLAPS) 92/129 variables, 37/89 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 37/126 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/129 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 12 (OVERLAPS) 0/129 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 126 constraints, problems are : Problem set: 0 solved, 111 unsolved in 4446 ms.
Refiners :[Domain max(s): 37/37 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 37/37 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (OVERLAPS) 5/37 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-05-29 04:54:12] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 2 ms to minimize.
[2024-05-29 04:54:12] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/37 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 10 (OVERLAPS) 92/129 variables, 37/91 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/129 variables, 37/128 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/129 variables, 111/239 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/129 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 14 (OVERLAPS) 0/129 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 239 constraints, problems are : Problem set: 0 solved, 111 unsolved in 5129 ms.
Refiners :[Domain max(s): 37/37 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 37/37 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 5/5 constraints]
After SMT, in 9727ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 9730ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10029 ms. Remains : 37/37 places, 116/116 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 170 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
RANDOM walk for 16 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 1 factoid took 236 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p1)]
[2024-05-29 04:54:17] [INFO ] Flow matrix only has 92 transitions (discarded 24 similar events)
[2024-05-29 04:54:17] [INFO ] Invariant cache hit.
[2024-05-29 04:54:17] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-05-29 04:54:17] [INFO ] [Real]Absence check using 9 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-29 04:54:17] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2024-05-29 04:54:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 04:54:17] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2024-05-29 04:54:17] [INFO ] [Nat]Absence check using 9 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-29 04:54:17] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-05-29 04:54:17] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-29 04:54:17] [INFO ] [Nat]Added 37 Read/Feed constraints in 12 ms returned sat
[2024-05-29 04:54:17] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 2 ms to minimize.
[2024-05-29 04:54:17] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-29 04:54:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 129 ms
[2024-05-29 04:54:17] [INFO ] Computed and/alt/rep : 12/63/12 causal constraints (skipped 75 transitions) in 21 ms.
[2024-05-29 04:54:17] [INFO ] Added : 4 causal constraints over 2 iterations in 62 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 131 ms :[(NOT p1)]
Product exploration explored 100000 steps with 24521 reset in 228 ms.
Product exploration explored 100000 steps with 24569 reset in 258 ms.
Built C files in :
/tmp/ltsmin1081868251640420559
[2024-05-29 04:54:18] [INFO ] Computing symmetric may disable matrix : 116 transitions.
[2024-05-29 04:54:18] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:54:18] [INFO ] Computing symmetric may enable matrix : 116 transitions.
[2024-05-29 04:54:18] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:54:18] [INFO ] Computing Do-Not-Accords matrix : 116 transitions.
[2024-05-29 04:54:18] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:54:18] [INFO ] Built C files in 73ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1081868251640420559
Running compilation step : cd /tmp/ltsmin1081868251640420559;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1076 ms.
Running link step : cd /tmp/ltsmin1081868251640420559;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 70 ms.
Running LTSmin : cd /tmp/ltsmin1081868251640420559;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15758923815825467698.hoa' '--buchi-type=spotba'
LTSmin run took 359 ms.
FORMULA SimpleLoadBal-PT-05-LTLCardinality-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SimpleLoadBal-PT-05-LTLCardinality-10 finished in 32769 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(F(p0))))'
Support contains 2 out of 55 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 55 /55 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-29 04:54:20] [INFO ] Flow matrix only has 140 transitions (discarded 40 similar events)
// Phase 1: matrix 140 rows 55 cols
[2024-05-29 04:54:20] [INFO ] Computed 15 invariants in 2 ms
[2024-05-29 04:54:20] [INFO ] Implicit Places using invariants in 149 ms returned [5, 6, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 150 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 52/55 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 52 /52 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 154 ms. Remains : 52/55 places, 180/180 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SimpleLoadBal-PT-05-LTLCardinality-11
Product exploration explored 100000 steps with 1186 reset in 361 ms.
Stack based approach found an accepted trace after 221 steps with 1 reset with depth 109 and stack size 109 in 1 ms.
FORMULA SimpleLoadBal-PT-05-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property SimpleLoadBal-PT-05-LTLCardinality-11 finished in 666 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 55 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 55/55 places, 180/180 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 55 transition count 176
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 51 transition count 176
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 47 transition count 172
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 22 place count 43 transition count 170
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 41 transition count 168
Applied a total of 26 rules in 22 ms. Remains 41 /55 variables (removed 14) and now considering 168/180 (removed 12) transitions.
[2024-05-29 04:54:20] [INFO ] Flow matrix only has 128 transitions (discarded 40 similar events)
// Phase 1: matrix 128 rows 41 cols
[2024-05-29 04:54:20] [INFO ] Computed 13 invariants in 2 ms
[2024-05-29 04:54:20] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-29 04:54:20] [INFO ] Flow matrix only has 128 transitions (discarded 40 similar events)
[2024-05-29 04:54:20] [INFO ] Invariant cache hit.
[2024-05-29 04:54:20] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-29 04:54:21] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2024-05-29 04:54:21] [INFO ] Redundant transitions in 1 ms returned []
Running 163 sub problems to find dead transitions.
[2024-05-29 04:54:21] [INFO ] Flow matrix only has 128 transitions (discarded 40 similar events)
[2024-05-29 04:54:21] [INFO ] Invariant cache hit.
[2024-05-29 04:54:21] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-29 04:54:22] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 2 ms to minimize.
Problem TDEAD97 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 1/42 constraints. Problems are: Problem set: 1 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/42 constraints. Problems are: Problem set: 1 solved, 162 unsolved
At refinement iteration 5 (OVERLAPS) 4/40 variables, 5/47 constraints. Problems are: Problem set: 1 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 4/51 constraints. Problems are: Problem set: 1 solved, 162 unsolved
[2024-05-29 04:54:23] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2024-05-29 04:54:23] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 2 ms to minimize.
[2024-05-29 04:54:23] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 2 ms to minimize.
[2024-05-29 04:54:24] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 2 ms to minimize.
[2024-05-29 04:54:24] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-29 04:54:24] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-29 04:54:24] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 7/58 constraints. Problems are: Problem set: 1 solved, 162 unsolved
[2024-05-29 04:54:24] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2024-05-29 04:54:24] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/40 variables, 2/60 constraints. Problems are: Problem set: 1 solved, 162 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/40 variables, 0/60 constraints. Problems are: Problem set: 1 solved, 162 unsolved
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD150 is UNSAT
At refinement iteration 10 (OVERLAPS) 1/41 variables, 3/63 constraints. Problems are: Problem set: 40 solved, 123 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/41 variables, 1/64 constraints. Problems are: Problem set: 40 solved, 123 unsolved
[2024-05-29 04:54:26] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2024-05-29 04:54:26] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-29 04:54:26] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 0 ms to minimize.
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
[2024-05-29 04:54:26] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 2 ms to minimize.
[2024-05-29 04:54:26] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-29 04:54:26] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
Problem TDEAD163 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/41 variables, 6/70 constraints. Problems are: Problem set: 43 solved, 120 unsolved
[2024-05-29 04:54:27] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
Problem TDEAD162 is UNSAT
At refinement iteration 13 (INCLUDED_ONLY) 0/41 variables, 1/71 constraints. Problems are: Problem set: 44 solved, 119 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/41 variables, 0/71 constraints. Problems are: Problem set: 44 solved, 119 unsolved
At refinement iteration 15 (OVERLAPS) 128/169 variables, 41/112 constraints. Problems are: Problem set: 44 solved, 119 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/169 variables, 55/167 constraints. Problems are: Problem set: 44 solved, 119 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/169 variables, 0/167 constraints. Problems are: Problem set: 44 solved, 119 unsolved
At refinement iteration 18 (OVERLAPS) 0/169 variables, 0/167 constraints. Problems are: Problem set: 44 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 167 constraints, problems are : Problem set: 44 solved, 119 unsolved in 10595 ms.
Refiners :[Domain max(s): 41/41 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 41/41 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 44 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 36/36 constraints. Problems are: Problem set: 44 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 4/40 constraints. Problems are: Problem set: 44 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 1/41 constraints. Problems are: Problem set: 44 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 9/50 constraints. Problems are: Problem set: 44 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/50 constraints. Problems are: Problem set: 44 solved, 119 unsolved
At refinement iteration 5 (OVERLAPS) 4/40 variables, 5/55 constraints. Problems are: Problem set: 44 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 4/59 constraints. Problems are: Problem set: 44 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 5/64 constraints. Problems are: Problem set: 44 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40 variables, 0/64 constraints. Problems are: Problem set: 44 solved, 119 unsolved
At refinement iteration 9 (OVERLAPS) 1/41 variables, 3/67 constraints. Problems are: Problem set: 44 solved, 119 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/41 variables, 1/68 constraints. Problems are: Problem set: 44 solved, 119 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/41 variables, 3/71 constraints. Problems are: Problem set: 44 solved, 119 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/41 variables, 0/71 constraints. Problems are: Problem set: 44 solved, 119 unsolved
At refinement iteration 13 (OVERLAPS) 128/169 variables, 41/112 constraints. Problems are: Problem set: 44 solved, 119 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/169 variables, 55/167 constraints. Problems are: Problem set: 44 solved, 119 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/169 variables, 119/286 constraints. Problems are: Problem set: 44 solved, 119 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/169 variables, 0/286 constraints. Problems are: Problem set: 44 solved, 119 unsolved
At refinement iteration 17 (OVERLAPS) 0/169 variables, 0/286 constraints. Problems are: Problem set: 44 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 286 constraints, problems are : Problem set: 44 solved, 119 unsolved in 7868 ms.
Refiners :[Domain max(s): 41/41 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 41/41 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 119/163 constraints, Known Traps: 17/17 constraints]
After SMT, in 18831ms problems are : Problem set: 44 solved, 119 unsolved
Search for dead transitions found 44 dead transitions in 18835ms
Found 44 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 44 transitions
Dead transitions reduction (with SMT) removed 44 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 41/55 places, 124/180 transitions.
Reduce places removed 2 places and 2 transitions.
Reduce places removed 1 places and 6 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 38 transition count 116
Applied a total of 1 rules in 5 ms. Remains 38 /41 variables (removed 3) and now considering 116/124 (removed 8) transitions.
[2024-05-29 04:54:39] [INFO ] Flow matrix only has 92 transitions (discarded 24 similar events)
// Phase 1: matrix 92 rows 38 cols
[2024-05-29 04:54:39] [INFO ] Computed 13 invariants in 4 ms
[2024-05-29 04:54:39] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-29 04:54:39] [INFO ] Flow matrix only has 92 transitions (discarded 24 similar events)
[2024-05-29 04:54:39] [INFO ] Invariant cache hit.
[2024-05-29 04:54:40] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-29 04:54:40] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 38/55 places, 116/180 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 19389 ms. Remains : 38/55 places, 116/180 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SimpleLoadBal-PT-05-LTLCardinality-12
Product exploration explored 100000 steps with 660 reset in 244 ms.
Stack based approach found an accepted trace after 59661 steps with 377 reset with depth 495 and stack size 373 in 254 ms.
FORMULA SimpleLoadBal-PT-05-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property SimpleLoadBal-PT-05-LTLCardinality-12 finished in 19980 ms.
All properties solved by simple procedures.
Total runtime 111212 ms.

BK_STOP 1716958480764

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-05"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is SimpleLoadBal-PT-05, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r378-smll-171683810900155"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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