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.r532-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 ltsminxred
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 r532-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 1717251795038

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SimpleLoadBal-PT-05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:23:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 14:23:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:23:18] [INFO ] Load time of PNML (sax parser for PT used): 349 ms
[2024-06-01 14:23:18] [INFO ] Transformed 59 places.
[2024-06-01 14:23:18] [INFO ] Transformed 180 transitions.
[2024-06-01 14:23:18] [INFO ] Found NUPN structural information;
[2024-06-01 14:23:18] [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-06-01 14:23:18] [INFO ] Parsed PT model containing 59 places and 180 transitions and 1158 arcs in 590 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 42 ms. Remains 59 /59 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-06-01 14:23:18] [INFO ] Flow matrix only has 140 transitions (discarded 40 similar events)
// Phase 1: matrix 140 rows 59 cols
[2024-06-01 14:23:18] [INFO ] Computed 19 invariants in 34 ms
[2024-06-01 14:23:19] [INFO ] Implicit Places using invariants in 486 ms returned [6, 8, 22, 23]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 565 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 653 ms. Remains : 55/59 places, 180/180 transitions.
Support contains 25 out of 55 places after structural reductions.
[2024-06-01 14:23:19] [INFO ] Flatten gal took : 125 ms
[2024-06-01 14:23:19] [INFO ] Flatten gal took : 46 ms
[2024-06-01 14:23:19] [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 1363 steps (0 resets) in 194 ms. (6 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 2 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 97 ms. Remains 43 /55 variables (removed 12) and now considering 170/180 (removed 10) transitions.
[2024-06-01 14:23:20] [INFO ] Flow matrix only has 130 transitions (discarded 40 similar events)
// Phase 1: matrix 130 rows 43 cols
[2024-06-01 14:23:20] [INFO ] Computed 13 invariants in 6 ms
[2024-06-01 14:23:20] [INFO ] Implicit Places using invariants in 223 ms returned []
[2024-06-01 14:23:20] [INFO ] Flow matrix only has 130 transitions (discarded 40 similar events)
[2024-06-01 14:23:20] [INFO ] Invariant cache hit.
[2024-06-01 14:23:20] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-06-01 14:23:21] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 565 ms to find 0 implicit places.
[2024-06-01 14:23:21] [INFO ] Redundant transitions in 10 ms returned []
Running 165 sub problems to find dead transitions.
[2024-06-01 14:23:21] [INFO ] Flow matrix only has 130 transitions (discarded 40 similar events)
[2024-06-01 14:23:21] [INFO ] Invariant cache hit.
[2024-06-01 14:23:21] [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-06-01 14:23:23] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 16 ms to minimize.
Problem TDEAD102 is UNSAT
[2024-06-01 14:23:23] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 2 ms to minimize.
[2024-06-01 14:23:23] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 3 ms to minimize.
[2024-06-01 14:23:24] [INFO ] Deduced a trap composed of 9 places in 83 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-06-01 14:23:26] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 2 ms to minimize.
[2024-06-01 14:23:26] [INFO ] Deduced a trap composed of 9 places in 179 ms of which 1 ms to minimize.
[2024-06-01 14:23:26] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 2 ms to minimize.
[2024-06-01 14:23:26] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 1 ms to minimize.
[2024-06-01 14:23:26] [INFO ] Deduced a trap composed of 11 places in 70 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-06-01 14:23:27] [INFO ] Deduced a trap composed of 8 places in 89 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-06-01 14:23:29] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 2 ms to minimize.
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
[2024-06-01 14:23:29] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 1 ms to minimize.
[2024-06-01 14:23:29] [INFO ] Deduced a trap composed of 21 places in 69 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 12049 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 8936 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 21827ms problems are : Problem set: 44 solved, 121 unsolved
Search for dead transitions found 44 dead transitions in 21850ms
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 14 ms. Remains 40 /43 variables (removed 3) and now considering 118/126 (removed 8) transitions.
[2024-06-01 14:23:42] [INFO ] Flow matrix only has 94 transitions (discarded 24 similar events)
// Phase 1: matrix 94 rows 40 cols
[2024-06-01 14:23:42] [INFO ] Computed 13 invariants in 3 ms
[2024-06-01 14:23:43] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-01 14:23:43] [INFO ] Flow matrix only has 94 transitions (discarded 24 similar events)
[2024-06-01 14:23:43] [INFO ] Invariant cache hit.
[2024-06-01 14:23:43] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-01 14:23:43] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 303 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 22861 ms. Remains : 40/55 places, 118/180 transitions.
Stuttering acceptance computed with spot in 288 ms :[(NOT p0)]
Running random walk in product with property : SimpleLoadBal-PT-05-LTLCardinality-01
Product exploration explored 100000 steps with 0 reset in 921 ms.
Stack based approach found an accepted trace after 26 steps with 0 reset with depth 27 and stack size 27 in 0 ms.
FORMULA SimpleLoadBal-PT-05-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property SimpleLoadBal-PT-05-LTLCardinality-01 finished in 24192 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-06-01 14:23:44] [INFO ] Flow matrix only has 140 transitions (discarded 40 similar events)
// Phase 1: matrix 140 rows 55 cols
[2024-06-01 14:23:44] [INFO ] Computed 15 invariants in 4 ms
[2024-06-01 14:23:44] [INFO ] Implicit Places using invariants in 116 ms returned [6, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 117 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 2 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 121 ms. Remains : 53/55 places, 180/180 transitions.
Stuttering acceptance computed with spot in 238 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 4 steps with 0 reset in 1 ms.
FORMULA SimpleLoadBal-PT-05-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SimpleLoadBal-PT-05-LTLCardinality-04 finished in 392 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 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 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 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 1 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 40 ms. Remains 39 /55 variables (removed 16) and now considering 167/180 (removed 13) transitions.
[2024-06-01 14:23:44] [INFO ] Flow matrix only has 127 transitions (discarded 40 similar events)
// Phase 1: matrix 127 rows 39 cols
[2024-06-01 14:23:44] [INFO ] Computed 12 invariants in 3 ms
[2024-06-01 14:23:45] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-06-01 14:23:45] [INFO ] Flow matrix only has 127 transitions (discarded 40 similar events)
[2024-06-01 14:23:45] [INFO ] Invariant cache hit.
[2024-06-01 14:23:45] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-06-01 14:23:45] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
[2024-06-01 14:23:45] [INFO ] Redundant transitions in 10 ms returned []
Running 162 sub problems to find dead transitions.
[2024-06-01 14:23:45] [INFO ] Flow matrix only has 127 transitions (discarded 40 similar events)
[2024-06-01 14:23:45] [INFO ] Invariant cache hit.
[2024-06-01 14:23:45] [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-06-01 14:23:46] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
Problem TDEAD96 is UNSAT
[2024-06-01 14:23:47] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-06-01 14:23:47] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 1 ms to minimize.
[2024-06-01 14:23:47] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 1 ms to minimize.
[2024-06-01 14:23:47] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
[2024-06-01 14:23:47] [INFO ] Deduced a trap composed of 8 places in 71 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-06-01 14:23:50] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 1 ms to minimize.
[2024-06-01 14:23:50] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 2 ms to minimize.
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
[2024-06-01 14:23:50] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 2 ms to minimize.
[2024-06-01 14:23:50] [INFO ] Deduced a trap composed of 19 places in 71 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 8317 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 8172 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 16960ms problems are : Problem set: 44 solved, 118 unsolved
Search for dead transitions found 44 dead transitions in 16979ms
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 14 ms. Remains 36 /39 variables (removed 3) and now considering 115/123 (removed 8) transitions.
[2024-06-01 14:24:02] [INFO ] Flow matrix only has 91 transitions (discarded 24 similar events)
// Phase 1: matrix 91 rows 36 cols
[2024-06-01 14:24:02] [INFO ] Computed 12 invariants in 1 ms
[2024-06-01 14:24:02] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-06-01 14:24:02] [INFO ] Flow matrix only has 91 transitions (discarded 24 similar events)
[2024-06-01 14:24:02] [INFO ] Invariant cache hit.
[2024-06-01 14:24:02] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-01 14:24:02] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 253 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 17678 ms. Remains : 36/55 places, 115/180 transitions.
Stuttering acceptance computed with spot in 112 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 13 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 17808 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 1 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 21 ms. Remains 38 /55 variables (removed 17) and now considering 166/180 (removed 14) transitions.
[2024-06-01 14:24:02] [INFO ] Flow matrix only has 126 transitions (discarded 40 similar events)
// Phase 1: matrix 126 rows 38 cols
[2024-06-01 14:24:02] [INFO ] Computed 12 invariants in 2 ms
[2024-06-01 14:24:02] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-01 14:24:02] [INFO ] Flow matrix only has 126 transitions (discarded 40 similar events)
[2024-06-01 14:24:02] [INFO ] Invariant cache hit.
[2024-06-01 14:24:02] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-06-01 14:24:03] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
[2024-06-01 14:24:03] [INFO ] Redundant transitions in 10 ms returned []
Running 161 sub problems to find dead transitions.
[2024-06-01 14:24:03] [INFO ] Flow matrix only has 126 transitions (discarded 40 similar events)
[2024-06-01 14:24:03] [INFO ] Invariant cache hit.
[2024-06-01 14:24:03] [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-06-01 14:24:04] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
Problem TDEAD93 is UNSAT
[2024-06-01 14:24:04] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 1 ms to minimize.
[2024-06-01 14:24:04] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:24:05] [INFO ] Deduced a trap composed of 8 places in 66 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-06-01 14:24:05] [INFO ] Deduced a trap composed of 9 places in 76 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-06-01 14:24:08] [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-06-01 14:24:08] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 2 ms to minimize.
[2024-06-01 14:24:08] [INFO ] Deduced a trap composed of 8 places in 81 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-06-01 14:24:09] [INFO ] Deduced a trap composed of 18 places in 63 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-06-01 14:24:09] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 2 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 9624 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 8043 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 18149ms problems are : Problem set: 44 solved, 117 unsolved
Search for dead transitions found 44 dead transitions in 18153ms
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 11 ms. Remains 35 /38 variables (removed 3) and now considering 114/122 (removed 8) transitions.
[2024-06-01 14:24:21] [INFO ] Flow matrix only has 90 transitions (discarded 24 similar events)
// Phase 1: matrix 90 rows 35 cols
[2024-06-01 14:24:21] [INFO ] Computed 12 invariants in 2 ms
[2024-06-01 14:24:21] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-06-01 14:24:21] [INFO ] Flow matrix only has 90 transitions (discarded 24 similar events)
[2024-06-01 14:24:21] [INFO ] Invariant cache hit.
[2024-06-01 14:24:21] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-01 14:24:21] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 348 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 18907 ms. Remains : 35/55 places, 114/180 transitions.
Stuttering acceptance computed with spot in 128 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 13 steps with 0 reset in 1 ms.
FORMULA SimpleLoadBal-PT-05-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SimpleLoadBal-PT-05-LTLCardinality-07 finished in 19064 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 4 ms. Remains 55 /55 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-06-01 14:24:21] [INFO ] Flow matrix only has 140 transitions (discarded 40 similar events)
// Phase 1: matrix 140 rows 55 cols
[2024-06-01 14:24:21] [INFO ] Computed 15 invariants in 3 ms
[2024-06-01 14:24:21] [INFO ] Implicit Places using invariants in 128 ms returned [5, 6, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 130 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 136 ms. Remains : 52/55 places, 180/180 transitions.
Stuttering acceptance computed with spot in 176 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 1464 reset in 421 ms.
Stack based approach found an accepted trace after 1301 steps with 23 reset with depth 171 and stack size 171 in 7 ms.
FORMULA SimpleLoadBal-PT-05-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property SimpleLoadBal-PT-05-LTLCardinality-08 finished in 768 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 0 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 1 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 27 ms. Remains 40 /55 variables (removed 15) and now considering 168/180 (removed 12) transitions.
[2024-06-01 14:24:22] [INFO ] Flow matrix only has 128 transitions (discarded 40 similar events)
// Phase 1: matrix 128 rows 40 cols
[2024-06-01 14:24:22] [INFO ] Computed 12 invariants in 2 ms
[2024-06-01 14:24:22] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-06-01 14:24:22] [INFO ] Flow matrix only has 128 transitions (discarded 40 similar events)
[2024-06-01 14:24:22] [INFO ] Invariant cache hit.
[2024-06-01 14:24:22] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-06-01 14:24:23] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
[2024-06-01 14:24:23] [INFO ] Redundant transitions in 3 ms returned []
Running 163 sub problems to find dead transitions.
[2024-06-01 14:24:23] [INFO ] Flow matrix only has 128 transitions (discarded 40 similar events)
[2024-06-01 14:24:23] [INFO ] Invariant cache hit.
[2024-06-01 14:24:23] [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-06-01 14:24:26] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 1 ms to minimize.
[2024-06-01 14:24:26] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 2 ms to minimize.
Problem TDEAD93 is UNSAT
[2024-06-01 14:24:26] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 3 ms to minimize.
Problem TDEAD94 is UNSAT
[2024-06-01 14:24:26] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
Problem TDEAD148 is UNSAT
[2024-06-01 14:24:27] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 2 ms to minimize.
[2024-06-01 14:24:27] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 1 ms to minimize.
[2024-06-01 14:24:27] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 2 ms to minimize.
[2024-06-01 14:24:27] [INFO ] Deduced a trap composed of 10 places in 80 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-06-01 14:24:27] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
[2024-06-01 14:24:28] [INFO ] Deduced a trap composed of 20 places in 61 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-06-01 14:24:30] [INFO ] Deduced a trap composed of 8 places in 83 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 9917 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 6812 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 17076ms problems are : Problem set: 44 solved, 119 unsolved
Search for dead transitions found 44 dead transitions in 17081ms
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 11 ms. Remains 37 /40 variables (removed 3) and now considering 116/124 (removed 8) transitions.
[2024-06-01 14:24:40] [INFO ] Flow matrix only has 92 transitions (discarded 24 similar events)
// Phase 1: matrix 92 rows 37 cols
[2024-06-01 14:24:40] [INFO ] Computed 12 invariants in 1 ms
[2024-06-01 14:24:40] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-06-01 14:24:40] [INFO ] Flow matrix only has 92 transitions (discarded 24 similar events)
[2024-06-01 14:24:40] [INFO ] Invariant cache hit.
[2024-06-01 14:24:40] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-01 14:24:40] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 249 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 17776 ms. Remains : 37/55 places, 116/180 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p1)]
Running random walk in product with property : SimpleLoadBal-PT-05-LTLCardinality-10
Product exploration explored 100000 steps with 24386 reset in 550 ms.
Product exploration explored 100000 steps with 24423 reset in 410 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 191 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 15 steps (0 resets) in 6 ms. (2 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 155 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)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p1)]
[2024-06-01 14:24:41] [INFO ] Flow matrix only has 92 transitions (discarded 24 similar events)
[2024-06-01 14:24:41] [INFO ] Invariant cache hit.
[2024-06-01 14:24:42] [INFO ] [Real]Absence check using 9 positive place invariants in 12 ms returned sat
[2024-06-01 14:24:42] [INFO ] [Real]Absence check using 9 positive and 3 generalized place invariants in 3 ms returned sat
[2024-06-01 14:24:42] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-06-01 14:24:42] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:24:42] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-06-01 14:24:42] [INFO ] [Nat]Absence check using 9 positive and 3 generalized place invariants in 3 ms returned sat
[2024-06-01 14:24:42] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2024-06-01 14:24:42] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-01 14:24:42] [INFO ] [Nat]Added 37 Read/Feed constraints in 14 ms returned sat
[2024-06-01 14:24:42] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:24:42] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-06-01 14:24:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 127 ms
[2024-06-01 14:24:42] [INFO ] Computed and/alt/rep : 12/63/12 causal constraints (skipped 75 transitions) in 13 ms.
[2024-06-01 14:24:42] [INFO ] Added : 4 causal constraints over 2 iterations in 86 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 4 ms. Remains 37 /37 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2024-06-01 14:24:42] [INFO ] Flow matrix only has 92 transitions (discarded 24 similar events)
[2024-06-01 14:24:42] [INFO ] Invariant cache hit.
[2024-06-01 14:24:42] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-01 14:24:42] [INFO ] Flow matrix only has 92 transitions (discarded 24 similar events)
[2024-06-01 14:24:42] [INFO ] Invariant cache hit.
[2024-06-01 14:24:42] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-01 14:24:42] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2024-06-01 14:24:42] [INFO ] Redundant transitions in 1 ms returned []
Running 111 sub problems to find dead transitions.
[2024-06-01 14:24:42] [INFO ] Flow matrix only has 92 transitions (discarded 24 similar events)
[2024-06-01 14:24:42] [INFO ] Invariant cache hit.
[2024-06-01 14:24:42] [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-06-01 14:24:43] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-06-01 14:24:43] [INFO ] Deduced a trap composed of 13 places in 33 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-06-01 14:24:44] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 2 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 4955 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-06-01 14:24:48] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2024-06-01 14:24:49] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 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 6118 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 11209ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 11211ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11445 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 201 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 49 ms :[(NOT p1)]
RANDOM walk for 7 steps (0 resets) in 4 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 220 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 47 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p1)]
[2024-06-01 14:24:54] [INFO ] Flow matrix only has 92 transitions (discarded 24 similar events)
[2024-06-01 14:24:54] [INFO ] Invariant cache hit.
[2024-06-01 14:24:54] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2024-06-01 14:24:54] [INFO ] [Real]Absence check using 9 positive and 3 generalized place invariants in 5 ms returned sat
[2024-06-01 14:24:54] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-06-01 14:24:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:24:54] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2024-06-01 14:24:54] [INFO ] [Nat]Absence check using 9 positive and 3 generalized place invariants in 4 ms returned sat
[2024-06-01 14:24:55] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-06-01 14:24:55] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-01 14:24:55] [INFO ] [Nat]Added 37 Read/Feed constraints in 13 ms returned sat
[2024-06-01 14:24:55] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 2 ms to minimize.
[2024-06-01 14:24:55] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 2 ms to minimize.
[2024-06-01 14:24:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 136 ms
[2024-06-01 14:24:55] [INFO ] Computed and/alt/rep : 12/63/12 causal constraints (skipped 75 transitions) in 22 ms.
[2024-06-01 14:24:55] [INFO ] Added : 4 causal constraints over 2 iterations in 64 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 50 ms :[(NOT p1)]
Product exploration explored 100000 steps with 24367 reset in 225 ms.
Product exploration explored 100000 steps with 24583 reset in 274 ms.
Support contains 2 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 116/116 transitions.
Applied a total of 0 rules in 6 ms. Remains 37 /37 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2024-06-01 14:24:55] [INFO ] Flow matrix only has 92 transitions (discarded 24 similar events)
[2024-06-01 14:24:55] [INFO ] Invariant cache hit.
[2024-06-01 14:24:55] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-06-01 14:24:55] [INFO ] Flow matrix only has 92 transitions (discarded 24 similar events)
[2024-06-01 14:24:55] [INFO ] Invariant cache hit.
[2024-06-01 14:24:55] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-01 14:24:56] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
[2024-06-01 14:24:56] [INFO ] Redundant transitions in 1 ms returned []
Running 111 sub problems to find dead transitions.
[2024-06-01 14:24:56] [INFO ] Flow matrix only has 92 transitions (discarded 24 similar events)
[2024-06-01 14:24:56] [INFO ] Invariant cache hit.
[2024-06-01 14:24:56] [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-06-01 14:24:57] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:24:57] [INFO ] Deduced a trap composed of 13 places in 47 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-06-01 14:24:58] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 2 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 5278 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-06-01 14:25:02] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:25:02] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 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 5237 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 10674ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 10678ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10989 ms. Remains : 37/37 places, 116/116 transitions.
Treatment of property SimpleLoadBal-PT-05-LTLCardinality-10 finished in 44308 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-06-01 14:25:06] [INFO ] Flow matrix only has 140 transitions (discarded 40 similar events)
// Phase 1: matrix 140 rows 55 cols
[2024-06-01 14:25:06] [INFO ] Computed 15 invariants in 2 ms
[2024-06-01 14:25:07] [INFO ] Implicit Places using invariants in 148 ms returned [5, 6, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 151 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 155 ms. Remains : 52/55 places, 180/180 transitions.
Stuttering acceptance computed with spot in 150 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 1180 reset in 302 ms.
Stack based approach found an accepted trace after 2059 steps with 29 reset with depth 126 and stack size 126 in 6 ms.
FORMULA SimpleLoadBal-PT-05-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property SimpleLoadBal-PT-05-LTLCardinality-11 finished in 632 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 18 ms. Remains 41 /55 variables (removed 14) and now considering 168/180 (removed 12) transitions.
[2024-06-01 14:25:07] [INFO ] Flow matrix only has 128 transitions (discarded 40 similar events)
// Phase 1: matrix 128 rows 41 cols
[2024-06-01 14:25:07] [INFO ] Computed 13 invariants in 1 ms
[2024-06-01 14:25:07] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-06-01 14:25:07] [INFO ] Flow matrix only has 128 transitions (discarded 40 similar events)
[2024-06-01 14:25:07] [INFO ] Invariant cache hit.
[2024-06-01 14:25:07] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-06-01 14:25:07] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2024-06-01 14:25:07] [INFO ] Redundant transitions in 1 ms returned []
Running 163 sub problems to find dead transitions.
[2024-06-01 14:25:07] [INFO ] Flow matrix only has 128 transitions (discarded 40 similar events)
[2024-06-01 14:25:07] [INFO ] Invariant cache hit.
[2024-06-01 14:25:07] [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-06-01 14:25:08] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 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-06-01 14:25:10] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:25:11] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-06-01 14:25:11] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 2 ms to minimize.
[2024-06-01 14:25:11] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 1 ms to minimize.
[2024-06-01 14:25:11] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 2 ms to minimize.
[2024-06-01 14:25:11] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:25:11] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 7/58 constraints. Problems are: Problem set: 1 solved, 162 unsolved
[2024-06-01 14:25:11] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:25:12] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 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-06-01 14:25:13] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 2 ms to minimize.
[2024-06-01 14:25:13] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-06-01 14:25:13] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
[2024-06-01 14:25:13] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 2 ms to minimize.
[2024-06-01 14:25:13] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 2 ms to minimize.
[2024-06-01 14:25:13] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 2 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-06-01 14:25:14] [INFO ] Deduced a trap composed of 8 places in 78 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 11363 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 7662 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 19264ms problems are : Problem set: 44 solved, 119 unsolved
Search for dead transitions found 44 dead transitions in 19266ms
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-06-01 14:25:27] [INFO ] Flow matrix only has 92 transitions (discarded 24 similar events)
// Phase 1: matrix 92 rows 38 cols
[2024-06-01 14:25:27] [INFO ] Computed 13 invariants in 3 ms
[2024-06-01 14:25:27] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-06-01 14:25:27] [INFO ] Flow matrix only has 92 transitions (discarded 24 similar events)
[2024-06-01 14:25:27] [INFO ] Invariant cache hit.
[2024-06-01 14:25:27] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-01 14:25:27] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 225 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 19808 ms. Remains : 38/55 places, 116/180 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SimpleLoadBal-PT-05-LTLCardinality-12
Product exploration explored 100000 steps with 669 reset in 328 ms.
Stack based approach found an accepted trace after 49399 steps with 357 reset with depth 53 and stack size 53 in 176 ms.
FORMULA SimpleLoadBal-PT-05-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property SimpleLoadBal-PT-05-LTLCardinality-12 finished in 20430 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)))'
[2024-06-01 14:25:28] [INFO ] Flatten gal took : 28 ms
[2024-06-01 14:25:28] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-06-01 14:25:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 55 places, 180 transitions and 1150 arcs took 5 ms.
Total runtime 130797 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA SimpleLoadBal-PT-05-LTLCardinality-10 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717251929043

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name SimpleLoadBal-PT-05-LTLCardinality-10
ltl formula formula --ltl=/tmp/1127/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 55 places, 180 transitions and 1150 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1127/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1127/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1127/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.010 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1127/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 57 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 56, there are 184 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~26 levels ~10000 states ~20128 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 10598
pnml2lts-mc( 0/ 4): unique states count: 10598
pnml2lts-mc( 0/ 4): unique transitions count: 22206
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 11691
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 10714
pnml2lts-mc( 0/ 4): - cum. max stack depth: 104
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 10714 states 22723 transitions, fanout: 2.121
pnml2lts-mc( 0/ 4): Total exploration time 0.180 sec (0.180 sec minimum, 0.180 sec on average)
pnml2lts-mc( 0/ 4): States per second: 59522, Transitions per second: 126239
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 17.8 B/state, compr.: 7.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 180 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~256.0MB paged-in)

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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