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.r443-smll-171701109900171.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is UtilityControlRoom-PT-Z2T3N10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r443-smll-171701109900171
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 28K Apr 13 05:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 144K Apr 13 05:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 35K Apr 13 05:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 155K Apr 13 05:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 23 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Apr 23 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 23 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 23 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 51K Apr 13 05:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 256K Apr 13 05:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 82K Apr 13 05:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 333K Apr 13 05:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.4K Apr 23 08:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 116K 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 UtilityControlRoom-PT-Z2T3N10-LTLCardinality-00
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLCardinality-01
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLCardinality-02
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLCardinality-03
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLCardinality-04
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLCardinality-05
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLCardinality-06
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLCardinality-07
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLCardinality-08
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLCardinality-09
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLCardinality-10
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLCardinality-11
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLCardinality-12
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLCardinality-13
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLCardinality-14
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717072748614

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-PT-Z2T3N10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 12:39:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-30 12:39:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 12:39:11] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2024-05-30 12:39:11] [INFO ] Transformed 174 places.
[2024-05-30 12:39:11] [INFO ] Transformed 270 transitions.
[2024-05-30 12:39:11] [INFO ] Parsed PT model containing 174 places and 270 transitions and 850 arcs in 492 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 40 transitions
Reduce redundant transitions removed 40 transitions.
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 138 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Applied a total of 0 rules in 15 ms. Remains 174 /174 variables (removed 0) and now considering 230/230 (removed 0) transitions.
// Phase 1: matrix 230 rows 174 cols
[2024-05-30 12:39:11] [INFO ] Computed 23 invariants in 28 ms
[2024-05-30 12:39:12] [INFO ] Implicit Places using invariants in 338 ms returned []
[2024-05-30 12:39:12] [INFO ] Invariant cache hit.
[2024-05-30 12:39:12] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 776 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2024-05-30 12:39:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 10/174 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 230/404 variables, 174/197 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (OVERLAPS) 0/404 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 404/404 variables, and 197 constraints, problems are : Problem set: 0 solved, 220 unsolved in 10996 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 10/174 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 230/404 variables, 174/197 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 220/417 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (OVERLAPS) 0/404 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Int declared 404/404 variables, and 417 constraints, problems are : Problem set: 0 solved, 220 unsolved in 12803 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints]
After SMT, in 24293ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 24335ms
Finished structural reductions in LTL mode , in 1 iterations and 25178 ms. Remains : 174/174 places, 230/230 transitions.
Support contains 138 out of 174 places after structural reductions.
[2024-05-30 12:39:37] [INFO ] Flatten gal took : 90 ms
[2024-05-30 12:39:37] [INFO ] Flatten gal took : 51 ms
[2024-05-30 12:39:37] [INFO ] Input system was already deterministic with 230 transitions.
RANDOM walk for 40000 steps (8 resets) in 2141 ms. (18 steps per ms) remains 6/23 properties
BEST_FIRST walk for 40002 steps (8 resets) in 309 ms. (129 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 196 ms. (203 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 115 ms. (344 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 112 ms. (354 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 104 ms. (380 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 95 ms. (416 steps per ms) remains 5/5 properties
[2024-05-30 12:39:38] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp21 is UNSAT
After SMT solving in domain Real declared 158/404 variables, and 15 constraints, problems are : Problem set: 5 solved, 0 unsolved in 85 ms.
Refiners :[Positive P Invariants (semi-flows): 15/23 constraints, State Equation: 0/174 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 100ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 5 atomic propositions for a total of 12 simplifications.
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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' '!(((G(p0) U p1)&&G(F(!p1))))'
Support contains 22 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 174 transition count 190
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 100 place count 134 transition count 170
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 100 place count 134 transition count 150
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 140 place count 114 transition count 150
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 160 place count 104 transition count 140
Applied a total of 160 rules in 55 ms. Remains 104 /174 variables (removed 70) and now considering 140/230 (removed 90) transitions.
// Phase 1: matrix 140 rows 104 cols
[2024-05-30 12:39:38] [INFO ] Computed 23 invariants in 3 ms
[2024-05-30 12:39:39] [INFO ] Implicit Places using invariants in 184 ms returned [62, 63]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 187 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/174 places, 140/230 transitions.
Applied a total of 0 rules in 20 ms. Remains 102 /102 variables (removed 0) and now considering 140/140 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 262 ms. Remains : 102/174 places, 140/230 transitions.
Stuttering acceptance computed with spot in 588 ms :[true, true, (NOT p0), (NOT p1), p1, p1]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 3 ms.
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLCardinality-00 finished in 948 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 30 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 174 transition count 190
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 100 place count 134 transition count 170
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 133 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 133 transition count 150
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 112 place count 123 transition count 140
Iterating global reduction 2 with 10 rules applied. Total rules applied 122 place count 123 transition count 140
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 21 rules applied. Total rules applied 143 place count 112 transition count 130
Applied a total of 143 rules in 87 ms. Remains 112 /174 variables (removed 62) and now considering 130/230 (removed 100) transitions.
// Phase 1: matrix 130 rows 112 cols
[2024-05-30 12:39:39] [INFO ] Computed 22 invariants in 3 ms
[2024-05-30 12:39:39] [INFO ] Implicit Places using invariants in 177 ms returned [81]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 180 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 111/174 places, 130/230 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 101 transition count 120
Applied a total of 20 rules in 17 ms. Remains 101 /111 variables (removed 10) and now considering 120/130 (removed 10) transitions.
// Phase 1: matrix 120 rows 101 cols
[2024-05-30 12:39:39] [INFO ] Computed 21 invariants in 2 ms
[2024-05-30 12:39:40] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-30 12:39:40] [INFO ] Invariant cache hit.
[2024-05-30 12:39:40] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 101/174 places, 120/230 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 702 ms. Remains : 101/174 places, 120/230 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLCardinality-02
Product exploration explored 100000 steps with 0 reset in 666 ms.
Stack based approach found an accepted trace after 5112 steps with 0 reset with depth 5113 and stack size 5113 in 22 ms.
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLCardinality-02 finished in 1464 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 71 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Applied a total of 0 rules in 2 ms. Remains 174 /174 variables (removed 0) and now considering 230/230 (removed 0) transitions.
// Phase 1: matrix 230 rows 174 cols
[2024-05-30 12:39:41] [INFO ] Computed 23 invariants in 2 ms
[2024-05-30 12:39:41] [INFO ] Implicit Places using invariants in 101 ms returned [123]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 104 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 173/174 places, 230/230 transitions.
Applied a total of 0 rules in 2 ms. Remains 173 /173 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 110 ms. Remains : 173/174 places, 230/230 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLCardinality-03 finished in 211 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&&X(X(p1)))))))'
Support contains 21 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 154 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 154 transition count 210
Applied a total of 40 rules in 6 ms. Remains 154 /174 variables (removed 20) and now considering 210/230 (removed 20) transitions.
// Phase 1: matrix 210 rows 154 cols
[2024-05-30 12:39:41] [INFO ] Computed 23 invariants in 2 ms
[2024-05-30 12:39:41] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-30 12:39:41] [INFO ] Invariant cache hit.
[2024-05-30 12:39:41] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-05-30 12:39:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/154 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/364 variables, 154/177 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/364 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 364/364 variables, and 177 constraints, problems are : Problem set: 0 solved, 200 unsolved in 8873 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/154 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/364 variables, 154/177 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 200/377 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/364 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 364/364 variables, and 377 constraints, problems are : Problem set: 0 solved, 200 unsolved in 11424 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 20455ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 20459ms
Starting structural reductions in LTL mode, iteration 1 : 154/174 places, 210/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20804 ms. Remains : 154/174 places, 210/230 transitions.
Stuttering acceptance computed with spot in 243 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLCardinality-04
Product exploration explored 100000 steps with 0 reset in 280 ms.
Stack based approach found an accepted trace after 16234 steps with 0 reset with depth 16235 and stack size 16235 in 82 ms.
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLCardinality-04 finished in 21428 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(F(p1)))))'
Support contains 30 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 154 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 154 transition count 210
Applied a total of 40 rules in 7 ms. Remains 154 /174 variables (removed 20) and now considering 210/230 (removed 20) transitions.
[2024-05-30 12:40:02] [INFO ] Invariant cache hit.
[2024-05-30 12:40:02] [INFO ] Implicit Places using invariants in 145 ms returned [103]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 147 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 153/174 places, 210/230 transitions.
Applied a total of 0 rules in 3 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 158 ms. Remains : 153/174 places, 210/230 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLCardinality-07
Product exploration explored 100000 steps with 5437 reset in 418 ms.
Product exploration explored 100000 steps with 5408 reset in 337 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 85 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 144 steps (0 resets) in 13 ms. (10 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 104 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 210 rows 153 cols
[2024-05-30 12:40:04] [INFO ] Computed 22 invariants in 3 ms
[2024-05-30 12:40:04] [INFO ] [Real]Absence check using 22 positive place invariants in 18 ms returned sat
[2024-05-30 12:40:04] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2024-05-30 12:40:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 12:40:05] [INFO ] [Nat]Absence check using 22 positive place invariants in 16 ms returned sat
[2024-05-30 12:40:05] [INFO ] [Nat]Absence check using state equation in 187 ms returned sat
[2024-05-30 12:40:05] [INFO ] Computed and/alt/rep : 200/310/200 causal constraints (skipped 0 transitions) in 21 ms.
[2024-05-30 12:40:05] [INFO ] Added : 56 causal constraints over 12 iterations in 265 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 10 out of 153 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Applied a total of 0 rules in 6 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2024-05-30 12:40:05] [INFO ] Invariant cache hit.
[2024-05-30 12:40:05] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-30 12:40:05] [INFO ] Invariant cache hit.
[2024-05-30 12:40:05] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-05-30 12:40:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 175 constraints, problems are : Problem set: 0 solved, 200 unsolved in 8117 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 200/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 375 constraints, problems are : Problem set: 0 solved, 200 unsolved in 10505 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 18760ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 18763ms
Finished structural reductions in LTL mode , in 1 iterations and 19012 ms. Remains : 153/153 places, 210/210 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 131 steps (0 resets) in 8 ms. (14 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-30 12:40:25] [INFO ] Invariant cache hit.
[2024-05-30 12:40:25] [INFO ] [Real]Absence check using 22 positive place invariants in 17 ms returned sat
[2024-05-30 12:40:25] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2024-05-30 12:40:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 12:40:25] [INFO ] [Nat]Absence check using 22 positive place invariants in 19 ms returned sat
[2024-05-30 12:40:25] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2024-05-30 12:40:25] [INFO ] Computed and/alt/rep : 200/310/200 causal constraints (skipped 0 transitions) in 19 ms.
[2024-05-30 12:40:26] [INFO ] Added : 74 causal constraints over 15 iterations in 342 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2939 reset in 207 ms.
Product exploration explored 100000 steps with 2947 reset in 811 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 10 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 153 transition count 230
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 153 transition count 230
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 0 with 30 rules applied. Total rules applied 50 place count 153 transition count 240
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 70 place count 153 transition count 220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 71 place count 152 transition count 200
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 72 place count 152 transition count 200
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 82 place count 142 transition count 190
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 92 place count 142 transition count 190
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 112 place count 122 transition count 150
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 132 place count 122 transition count 150
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 152 place count 102 transition count 130
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 172 place count 102 transition count 130
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 192 place count 102 transition count 110
Deduced a syphon composed of 30 places in 0 ms
Applied a total of 192 rules in 36 ms. Remains 102 /153 variables (removed 51) and now considering 110/210 (removed 100) transitions.
[2024-05-30 12:40:27] [INFO ] Redundant transitions in 3 ms returned []
Running 100 sub problems to find dead transitions.
// Phase 1: matrix 110 rows 102 cols
[2024-05-30 12:40:27] [INFO ] Computed 22 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 10/102 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-30 12:40:28] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 12 ms to minimize.
[2024-05-30 12:40:28] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 2 ms to minimize.
[2024-05-30 12:40:28] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 2 ms to minimize.
[2024-05-30 12:40:29] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 2 ms to minimize.
[2024-05-30 12:40:29] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 2 ms to minimize.
[2024-05-30 12:40:29] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 4 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-30 12:40:29] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-05-30 12:40:29] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 2 ms to minimize.
Problem TDEAD20 is UNSAT
[2024-05-30 12:40:29] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-05-30 12:40:29] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 10/32 constraints. Problems are: Problem set: 40 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/32 constraints. Problems are: Problem set: 40 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 110/212 variables, 102/134 constraints. Problems are: Problem set: 40 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/134 constraints. Problems are: Problem set: 40 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/212 variables, 0/134 constraints. Problems are: Problem set: 40 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 134 constraints, problems are : Problem set: 40 solved, 60 unsolved in 2711 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 40 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 40 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 40/102 variables, 22/22 constraints. Problems are: Problem set: 40 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 10/32 constraints. Problems are: Problem set: 40 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/32 constraints. Problems are: Problem set: 40 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 110/212 variables, 102/134 constraints. Problems are: Problem set: 40 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 60/194 constraints. Problems are: Problem set: 40 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/194 constraints. Problems are: Problem set: 40 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/212 variables, 0/194 constraints. Problems are: Problem set: 40 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 194 constraints, problems are : Problem set: 40 solved, 60 unsolved in 1480 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 60/100 constraints, Known Traps: 10/10 constraints]
After SMT, in 4214ms problems are : Problem set: 40 solved, 60 unsolved
Search for dead transitions found 40 dead transitions in 4217ms
Found 40 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 40 transitions
Dead transitions reduction (with SMT) removed 40 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 102/153 places, 70/210 transitions.
Graph (complete) has 130 edges and 102 vertex of which 72 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 72 /102 variables (removed 30) and now considering 70/70 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 72/153 places, 70/210 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4275 ms. Remains : 72/153 places, 70/210 transitions.
Support contains 10 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Applied a total of 0 rules in 3 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 153 cols
[2024-05-30 12:40:32] [INFO ] Computed 22 invariants in 2 ms
[2024-05-30 12:40:32] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-30 12:40:32] [INFO ] Invariant cache hit.
[2024-05-30 12:40:32] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-05-30 12:40:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 175 constraints, problems are : Problem set: 0 solved, 200 unsolved in 8362 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 200/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 375 constraints, problems are : Problem set: 0 solved, 200 unsolved in 10072 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 18555ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 18559ms
Finished structural reductions in LTL mode , in 1 iterations and 18914 ms. Remains : 153/153 places, 210/210 transitions.
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLCardinality-07 finished in 48257 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)||F(p1)))'
Support contains 4 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 174 transition count 192
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 57 rules applied. Total rules applied 95 place count 136 transition count 173
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 95 place count 136 transition count 154
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 133 place count 117 transition count 154
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 134 place count 116 transition count 153
Iterating global reduction 2 with 1 rules applied. Total rules applied 135 place count 116 transition count 153
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 155 place count 106 transition count 143
Applied a total of 155 rules in 23 ms. Remains 106 /174 variables (removed 68) and now considering 143/230 (removed 87) transitions.
// Phase 1: matrix 143 rows 106 cols
[2024-05-30 12:40:51] [INFO ] Computed 23 invariants in 1 ms
[2024-05-30 12:40:51] [INFO ] Implicit Places using invariants in 103 ms returned [55]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 105 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/174 places, 143/230 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 38 place count 86 transition count 124
Applied a total of 38 rules in 8 ms. Remains 86 /105 variables (removed 19) and now considering 124/143 (removed 19) transitions.
// Phase 1: matrix 124 rows 86 cols
[2024-05-30 12:40:51] [INFO ] Computed 22 invariants in 1 ms
[2024-05-30 12:40:51] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-30 12:40:51] [INFO ] Invariant cache hit.
[2024-05-30 12:40:51] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 86/174 places, 124/230 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 337 ms. Remains : 86/174 places, 124/230 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLCardinality-09
Product exploration explored 100000 steps with 5388 reset in 236 ms.
Stack based approach found an accepted trace after 28679 steps with 1542 reset with depth 13 and stack size 13 in 72 ms.
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLCardinality-09 finished in 757 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 154 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 154 transition count 210
Applied a total of 40 rules in 5 ms. Remains 154 /174 variables (removed 20) and now considering 210/230 (removed 20) transitions.
// Phase 1: matrix 210 rows 154 cols
[2024-05-30 12:40:51] [INFO ] Computed 23 invariants in 2 ms
[2024-05-30 12:40:51] [INFO ] Implicit Places using invariants in 132 ms returned [103]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 133 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 153/174 places, 210/230 transitions.
Applied a total of 0 rules in 2 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 141 ms. Remains : 153/174 places, 210/230 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLCardinality-10
Product exploration explored 100000 steps with 50000 reset in 117 ms.
Product exploration explored 100000 steps with 50000 reset in 134 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 13 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLCardinality-10 finished in 496 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 X((p1||F(p0))))))'
Support contains 2 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 154 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 154 transition count 210
Applied a total of 40 rules in 5 ms. Remains 154 /174 variables (removed 20) and now considering 210/230 (removed 20) transitions.
[2024-05-30 12:40:52] [INFO ] Invariant cache hit.
[2024-05-30 12:40:52] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-30 12:40:52] [INFO ] Invariant cache hit.
[2024-05-30 12:40:52] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-05-30 12:40:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/154 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/364 variables, 154/177 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/364 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 364/364 variables, and 177 constraints, problems are : Problem set: 0 solved, 200 unsolved in 8301 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/154 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/364 variables, 154/177 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 200/377 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/364 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 364/364 variables, and 377 constraints, problems are : Problem set: 0 solved, 200 unsolved in 11076 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 19500ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 19503ms
Starting structural reductions in LTL mode, iteration 1 : 154/174 places, 210/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19836 ms. Remains : 154/174 places, 210/230 transitions.
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLCardinality-12
Product exploration explored 100000 steps with 3 reset in 200 ms.
Product exploration explored 100000 steps with 26 reset in 260 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 97 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 17 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 196 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
[2024-05-30 12:41:13] [INFO ] Invariant cache hit.
[2024-05-30 12:41:13] [INFO ] [Real]Absence check using 23 positive place invariants in 19 ms returned sat
[2024-05-30 12:41:13] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2024-05-30 12:41:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 12:41:14] [INFO ] [Nat]Absence check using 23 positive place invariants in 20 ms returned sat
[2024-05-30 12:41:14] [INFO ] [Nat]Absence check using state equation in 201 ms returned sat
[2024-05-30 12:41:14] [INFO ] Computed and/alt/rep : 180/270/180 causal constraints (skipped 20 transitions) in 21 ms.
[2024-05-30 12:41:14] [INFO ] Added : 20 causal constraints over 5 iterations in 113 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 210/210 transitions.
Applied a total of 0 rules in 3 ms. Remains 154 /154 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2024-05-30 12:41:14] [INFO ] Invariant cache hit.
[2024-05-30 12:41:14] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-30 12:41:14] [INFO ] Invariant cache hit.
[2024-05-30 12:41:14] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-05-30 12:41:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/154 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/364 variables, 154/177 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/364 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 364/364 variables, and 177 constraints, problems are : Problem set: 0 solved, 200 unsolved in 8184 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/154 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/364 variables, 154/177 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 200/377 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/364 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 364/364 variables, and 377 constraints, problems are : Problem set: 0 solved, 200 unsolved in 10499 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 18802ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 18806ms
Finished structural reductions in LTL mode , in 1 iterations and 19187 ms. Remains : 154/154 places, 210/210 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 105 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 15 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 249 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
[2024-05-30 12:41:34] [INFO ] Invariant cache hit.
[2024-05-30 12:41:34] [INFO ] [Real]Absence check using 23 positive place invariants in 15 ms returned sat
[2024-05-30 12:41:34] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2024-05-30 12:41:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 12:41:35] [INFO ] [Nat]Absence check using 23 positive place invariants in 19 ms returned sat
[2024-05-30 12:41:35] [INFO ] [Nat]Absence check using state equation in 203 ms returned sat
[2024-05-30 12:41:35] [INFO ] Computed and/alt/rep : 180/270/180 causal constraints (skipped 20 transitions) in 23 ms.
[2024-05-30 12:41:35] [INFO ] Added : 20 causal constraints over 5 iterations in 152 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 41 reset in 353 ms.
Product exploration explored 100000 steps with 10 reset in 488 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 2 out of 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 210/210 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 154 transition count 230
Deduced a syphon composed of 20 places in 1 ms
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 154 transition count 230
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 50 places in 1 ms
Iterating global reduction 0 with 30 rules applied. Total rules applied 50 place count 154 transition count 240
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 70 place count 154 transition count 220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 71 place count 153 transition count 200
Deduced a syphon composed of 50 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 72 place count 153 transition count 200
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 82 place count 143 transition count 190
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 92 place count 143 transition count 190
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 112 place count 123 transition count 150
Deduced a syphon composed of 40 places in 1 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 132 place count 123 transition count 150
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 152 place count 103 transition count 130
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 172 place count 103 transition count 130
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 192 place count 103 transition count 110
Deduced a syphon composed of 30 places in 1 ms
Applied a total of 192 rules in 30 ms. Remains 103 /154 variables (removed 51) and now considering 110/210 (removed 100) transitions.
[2024-05-30 12:41:36] [INFO ] Redundant transitions in 3 ms returned []
Running 100 sub problems to find dead transitions.
// Phase 1: matrix 110 rows 103 cols
[2024-05-30 12:41:36] [INFO ] Computed 23 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 10/103 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-30 12:41:37] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-30 12:41:37] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-30 12:41:37] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-05-30 12:41:37] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-05-30 12:41:37] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-05-30 12:41:37] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-05-30 12:41:37] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-05-30 12:41:37] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-30 12:41:37] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-05-30 12:41:37] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-05-30 12:41:37] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 11/34 constraints. Problems are: Problem set: 40 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/34 constraints. Problems are: Problem set: 40 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 110/213 variables, 103/137 constraints. Problems are: Problem set: 40 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/137 constraints. Problems are: Problem set: 40 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/213 variables, 0/137 constraints. Problems are: Problem set: 40 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 137 constraints, problems are : Problem set: 40 solved, 60 unsolved in 2541 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 40 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 1/1 constraints. Problems are: Problem set: 40 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 40 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 40/103 variables, 23/24 constraints. Problems are: Problem set: 40 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 10/34 constraints. Problems are: Problem set: 40 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/34 constraints. Problems are: Problem set: 40 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 110/213 variables, 103/137 constraints. Problems are: Problem set: 40 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 60/197 constraints. Problems are: Problem set: 40 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 0/197 constraints. Problems are: Problem set: 40 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/213 variables, 0/197 constraints. Problems are: Problem set: 40 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 197 constraints, problems are : Problem set: 40 solved, 60 unsolved in 1771 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 60/100 constraints, Known Traps: 11/11 constraints]
After SMT, in 4333ms problems are : Problem set: 40 solved, 60 unsolved
Search for dead transitions found 40 dead transitions in 4335ms
Found 40 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 40 transitions
Dead transitions reduction (with SMT) removed 40 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 103/154 places, 70/210 transitions.
Graph (complete) has 151 edges and 103 vertex of which 73 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 73 /103 variables (removed 30) and now considering 70/70 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 73/154 places, 70/210 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4377 ms. Remains : 73/154 places, 70/210 transitions.
Support contains 2 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 210/210 transitions.
Applied a total of 0 rules in 1 ms. Remains 154 /154 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 154 cols
[2024-05-30 12:41:41] [INFO ] Computed 23 invariants in 2 ms
[2024-05-30 12:41:41] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-30 12:41:41] [INFO ] Invariant cache hit.
[2024-05-30 12:41:41] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-05-30 12:41:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/154 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/364 variables, 154/177 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/364 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 364/364 variables, and 177 constraints, problems are : Problem set: 0 solved, 200 unsolved in 8943 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/154 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/364 variables, 154/177 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 200/377 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/364 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 364/364 variables, and 377 constraints, problems are : Problem set: 0 solved, 200 unsolved in 11855 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 20912ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 20919ms
Finished structural reductions in LTL mode , in 1 iterations and 21331 ms. Remains : 154/154 places, 210/210 transitions.
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLCardinality-12 finished in 70123 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(G(p0)) U p0)))'
Support contains 2 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 174 transition count 192
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 57 rules applied. Total rules applied 95 place count 136 transition count 173
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 95 place count 136 transition count 154
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 133 place count 117 transition count 154
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 134 place count 116 transition count 153
Iterating global reduction 2 with 1 rules applied. Total rules applied 135 place count 116 transition count 153
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 175 place count 96 transition count 133
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 176 place count 96 transition count 132
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 177 place count 95 transition count 112
Ensure Unique test removed 1 places
Iterating global reduction 2 with 2 rules applied. Total rules applied 179 place count 94 transition count 112
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 189 place count 84 transition count 102
Iterating global reduction 2 with 10 rules applied. Total rules applied 199 place count 84 transition count 102
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 209 place count 74 transition count 82
Iterating global reduction 2 with 10 rules applied. Total rules applied 219 place count 74 transition count 82
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 228 place count 65 transition count 73
Iterating global reduction 2 with 9 rules applied. Total rules applied 237 place count 65 transition count 73
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 246 place count 65 transition count 64
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 262 place count 57 transition count 56
Applied a total of 262 rules in 29 ms. Remains 57 /174 variables (removed 117) and now considering 56/230 (removed 174) transitions.
// Phase 1: matrix 56 rows 57 cols
[2024-05-30 12:42:02] [INFO ] Computed 22 invariants in 2 ms
[2024-05-30 12:42:02] [INFO ] Implicit Places using invariants in 74 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 76 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/174 places, 56/230 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 46 transition count 46
Applied a total of 20 rules in 4 ms. Remains 46 /56 variables (removed 10) and now considering 46/56 (removed 10) transitions.
// Phase 1: matrix 46 rows 46 cols
[2024-05-30 12:42:02] [INFO ] Computed 21 invariants in 1 ms
[2024-05-30 12:42:02] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-30 12:42:02] [INFO ] Invariant cache hit.
[2024-05-30 12:42:02] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 46/174 places, 46/230 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 234 ms. Remains : 46/174 places, 46/230 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLCardinality-13
Product exploration explored 100000 steps with 0 reset in 180 ms.
Stack based approach found an accepted trace after 56 steps with 0 reset with depth 57 and stack size 57 in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLCardinality-13 finished in 486 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 154 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 154 transition count 210
Applied a total of 40 rules in 4 ms. Remains 154 /174 variables (removed 20) and now considering 210/230 (removed 20) transitions.
// Phase 1: matrix 210 rows 154 cols
[2024-05-30 12:42:02] [INFO ] Computed 23 invariants in 1 ms
[2024-05-30 12:42:03] [INFO ] Implicit Places using invariants in 108 ms returned [103]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 111 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 153/174 places, 210/230 transitions.
Applied a total of 0 rules in 1 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 116 ms. Remains : 153/174 places, 210/230 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLCardinality-14
Product exploration explored 100000 steps with 7247 reset in 186 ms.
Product exploration explored 100000 steps with 7300 reset in 204 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 1 factoid took 212 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 41 steps (0 resets) in 5 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 208 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 210 rows 153 cols
[2024-05-30 12:42:04] [INFO ] Computed 22 invariants in 1 ms
[2024-05-30 12:42:04] [INFO ] [Real]Absence check using 22 positive place invariants in 10 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 1 factoid took 260 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLCardinality-14 FALSE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLCardinality-14 finished in 1707 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 4 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 154 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 154 transition count 210
Applied a total of 40 rules in 3 ms. Remains 154 /174 variables (removed 20) and now considering 210/230 (removed 20) transitions.
// Phase 1: matrix 210 rows 154 cols
[2024-05-30 12:42:04] [INFO ] Computed 23 invariants in 8 ms
[2024-05-30 12:42:04] [INFO ] Implicit Places using invariants in 143 ms returned [103]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 144 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 153/174 places, 210/230 transitions.
Applied a total of 0 rules in 1 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 148 ms. Remains : 153/174 places, 210/230 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLCardinality-15 finished in 317 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(F(p1)))))'
Found a Shortening insensitive property : UtilityControlRoom-PT-Z2T3N10-LTLCardinality-07
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 30 out of 174 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 174 transition count 190
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 100 place count 134 transition count 170
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 133 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 133 transition count 150
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 112 place count 123 transition count 140
Iterating global reduction 2 with 10 rules applied. Total rules applied 122 place count 123 transition count 140
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 142 place count 113 transition count 130
Applied a total of 142 rules in 14 ms. Remains 113 /174 variables (removed 61) and now considering 130/230 (removed 100) transitions.
// Phase 1: matrix 130 rows 113 cols
[2024-05-30 12:42:05] [INFO ] Computed 23 invariants in 1 ms
[2024-05-30 12:42:05] [INFO ] Implicit Places using invariants in 85 ms returned [72]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 86 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 112/174 places, 130/230 transitions.
Applied a total of 0 rules in 2 ms. Remains 112 /112 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 103 ms. Remains : 112/174 places, 130/230 transitions.
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLCardinality-07
Product exploration explored 100000 steps with 7238 reset in 203 ms.
Product exploration explored 100000 steps with 7332 reset in 221 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 86 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 87 steps (0 resets) in 6 ms. (12 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 101 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 130 rows 112 cols
[2024-05-30 12:42:06] [INFO ] Computed 22 invariants in 1 ms
[2024-05-30 12:42:06] [INFO ] [Real]Absence check using 22 positive place invariants in 17 ms returned sat
[2024-05-30 12:42:06] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2024-05-30 12:42:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 12:42:06] [INFO ] [Nat]Absence check using 22 positive place invariants in 10 ms returned sat
[2024-05-30 12:42:06] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2024-05-30 12:42:06] [INFO ] Computed and/alt/rep : 110/210/110 causal constraints (skipped 0 transitions) in 13 ms.
[2024-05-30 12:42:07] [INFO ] Added : 110 causal constraints over 22 iterations in 389 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 10 out of 112 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 130/130 transitions.
Applied a total of 0 rules in 1 ms. Remains 112 /112 variables (removed 0) and now considering 130/130 (removed 0) transitions.
[2024-05-30 12:42:07] [INFO ] Invariant cache hit.
[2024-05-30 12:42:07] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-30 12:42:07] [INFO ] Invariant cache hit.
[2024-05-30 12:42:07] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Running 110 sub problems to find dead transitions.
[2024-05-30 12:42:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 10/112 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 130/242 variables, 112/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 0/242 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 134 constraints, problems are : Problem set: 0 solved, 110 unsolved in 3053 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 10/112 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 130/242 variables, 112/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 110/244 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 0/242 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 244 constraints, problems are : Problem set: 0 solved, 110 unsolved in 3615 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
After SMT, in 6694ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 6696ms
Finished structural reductions in LTL mode , in 1 iterations and 6908 ms. Remains : 112/112 places, 130/130 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 91 steps (0 resets) in 4 ms. (18 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-30 12:42:14] [INFO ] Invariant cache hit.
[2024-05-30 12:42:14] [INFO ] [Real]Absence check using 22 positive place invariants in 16 ms returned sat
[2024-05-30 12:42:14] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2024-05-30 12:42:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 12:42:15] [INFO ] [Nat]Absence check using 22 positive place invariants in 13 ms returned sat
[2024-05-30 12:42:15] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2024-05-30 12:42:15] [INFO ] Computed and/alt/rep : 110/210/110 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-30 12:42:15] [INFO ] Added : 110 causal constraints over 22 iterations in 364 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4110 reset in 207 ms.
Product exploration explored 100000 steps with 4107 reset in 224 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 10 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 130/130 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 112 transition count 130
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 30 place count 102 transition count 110
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 40 place count 102 transition count 110
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 60 place count 82 transition count 90
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 80 place count 82 transition count 90
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 90 place count 82 transition count 80
Deduced a syphon composed of 10 places in 0 ms
Applied a total of 90 rules in 15 ms. Remains 82 /112 variables (removed 30) and now considering 80/130 (removed 50) transitions.
[2024-05-30 12:42:16] [INFO ] Redundant transitions in 2 ms returned []
Running 70 sub problems to find dead transitions.
// Phase 1: matrix 80 rows 82 cols
[2024-05-30 12:42:16] [INFO ] Computed 22 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 10/82 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-30 12:42:17] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-05-30 12:42:17] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 1 ms to minimize.
[2024-05-30 12:42:17] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 2 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-30 12:42:17] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 2 ms to minimize.
[2024-05-30 12:42:17] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 1 ms to minimize.
[2024-05-30 12:42:17] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-05-30 12:42:17] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 2 ms to minimize.
[2024-05-30 12:42:17] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 2 ms to minimize.
[2024-05-30 12:42:17] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 3 ms to minimize.
[2024-05-30 12:42:17] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 10/32 constraints. Problems are: Problem set: 10 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/32 constraints. Problems are: Problem set: 10 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 80/162 variables, 82/114 constraints. Problems are: Problem set: 10 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/114 constraints. Problems are: Problem set: 10 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/162 variables, 0/114 constraints. Problems are: Problem set: 10 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 114 constraints, problems are : Problem set: 10 solved, 60 unsolved in 2094 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 10 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 20/82 variables, 22/22 constraints. Problems are: Problem set: 10 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 10/32 constraints. Problems are: Problem set: 10 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/32 constraints. Problems are: Problem set: 10 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 80/162 variables, 82/114 constraints. Problems are: Problem set: 10 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 60/174 constraints. Problems are: Problem set: 10 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/174 constraints. Problems are: Problem set: 10 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/162 variables, 0/174 constraints. Problems are: Problem set: 10 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 174 constraints, problems are : Problem set: 10 solved, 60 unsolved in 1518 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 60/70 constraints, Known Traps: 10/10 constraints]
After SMT, in 3635ms problems are : Problem set: 10 solved, 60 unsolved
Search for dead transitions found 10 dead transitions in 3637ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 82/112 places, 70/130 transitions.
Graph (complete) has 130 edges and 82 vertex of which 72 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Discarding 10 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 72 /82 variables (removed 10) and now considering 70/70 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 72/112 places, 70/130 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3667 ms. Remains : 72/112 places, 70/130 transitions.
Support contains 10 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 130/130 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 102 transition count 110
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 102 transition count 110
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 92 transition count 100
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 92 transition count 100
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 50 place count 82 transition count 90
Iterating global reduction 0 with 10 rules applied. Total rules applied 60 place count 82 transition count 90
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 70 place count 82 transition count 80
Applied a total of 70 rules in 5 ms. Remains 82 /112 variables (removed 30) and now considering 80/130 (removed 50) transitions.
// Phase 1: matrix 80 rows 82 cols
[2024-05-30 12:42:20] [INFO ] Computed 22 invariants in 1 ms
[2024-05-30 12:42:20] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-30 12:42:20] [INFO ] Invariant cache hit.
[2024-05-30 12:42:20] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
Running 70 sub problems to find dead transitions.
[2024-05-30 12:42:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 10/82 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 80/162 variables, 82/104 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (OVERLAPS) 0/162 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 104 constraints, problems are : Problem set: 0 solved, 70 unsolved in 2012 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 10/82 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 80/162 variables, 82/104 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 70/174 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 0/162 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 174 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1495 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
After SMT, in 3520ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 3521ms
Starting structural reductions in LTL mode, iteration 1 : 82/112 places, 80/130 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3761 ms. Remains : 82/112 places, 80/130 transitions.
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLCardinality-07 finished in 19015 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 X((p1||F(p0))))))'
Found a Lengthening insensitive property : UtilityControlRoom-PT-Z2T3N10-LTLCardinality-12
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 2 out of 174 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 174 transition count 190
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 100 place count 134 transition count 170
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 100 place count 134 transition count 150
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 140 place count 114 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 141 place count 113 transition count 130
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 113 transition count 130
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 152 place count 103 transition count 120
Iterating global reduction 2 with 10 rules applied. Total rules applied 162 place count 103 transition count 120
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 172 place count 93 transition count 100
Iterating global reduction 2 with 10 rules applied. Total rules applied 182 place count 93 transition count 100
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 192 place count 83 transition count 90
Iterating global reduction 2 with 10 rules applied. Total rules applied 202 place count 83 transition count 90
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 212 place count 83 transition count 80
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 212 place count 83 transition count 70
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 232 place count 73 transition count 70
Applied a total of 232 rules in 17 ms. Remains 73 /174 variables (removed 101) and now considering 70/230 (removed 160) transitions.
// Phase 1: matrix 70 rows 73 cols
[2024-05-30 12:42:24] [INFO ] Computed 23 invariants in 1 ms
[2024-05-30 12:42:24] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-30 12:42:24] [INFO ] Invariant cache hit.
[2024-05-30 12:42:24] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-30 12:42:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 10/73 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 70/143 variables, 73/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/143 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 96 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1640 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 10/73 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 70/143 variables, 73/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 60/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/143 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 156 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1723 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 3386ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3387ms
Starting structural reductions in LI_LTL mode, iteration 1 : 73/174 places, 70/230 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 3615 ms. Remains : 73/174 places, 70/230 transitions.
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLCardinality-12
Product exploration explored 100000 steps with 10 reset in 183 ms.
Product exploration explored 100000 steps with 4 reset in 325 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 98 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 17 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 194 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
[2024-05-30 12:42:29] [INFO ] Invariant cache hit.
[2024-05-30 12:42:29] [INFO ] [Real]Absence check using 23 positive place invariants in 16 ms returned sat
[2024-05-30 12:42:29] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2024-05-30 12:42:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 12:42:29] [INFO ] [Nat]Absence check using 23 positive place invariants in 11 ms returned sat
[2024-05-30 12:42:29] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-05-30 12:42:29] [INFO ] Computed and/alt/rep : 50/70/50 causal constraints (skipped 10 transitions) in 5 ms.
[2024-05-30 12:42:29] [INFO ] Added : 2 causal constraints over 1 iterations in 22 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 70/70 transitions.
Applied a total of 0 rules in 1 ms. Remains 73 /73 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2024-05-30 12:42:29] [INFO ] Invariant cache hit.
[2024-05-30 12:42:29] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-30 12:42:29] [INFO ] Invariant cache hit.
[2024-05-30 12:42:29] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-30 12:42:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 10/73 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 70/143 variables, 73/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/143 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 96 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1374 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 10/73 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 70/143 variables, 73/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 60/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/143 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 156 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1496 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 2886ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2887ms
Finished structural reductions in LTL mode , in 1 iterations and 3095 ms. Remains : 73/73 places, 70/70 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 96 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 15 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 196 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
[2024-05-30 12:42:33] [INFO ] Invariant cache hit.
[2024-05-30 12:42:33] [INFO ] [Real]Absence check using 23 positive place invariants in 15 ms returned sat
[2024-05-30 12:42:33] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2024-05-30 12:42:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 12:42:33] [INFO ] [Nat]Absence check using 23 positive place invariants in 11 ms returned sat
[2024-05-30 12:42:33] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2024-05-30 12:42:33] [INFO ] Computed and/alt/rep : 50/70/50 causal constraints (skipped 10 transitions) in 13 ms.
[2024-05-30 12:42:33] [INFO ] Added : 2 causal constraints over 1 iterations in 38 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 16 reset in 182 ms.
Product exploration explored 100000 steps with 6 reset in 239 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 2 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 70/70 transitions.
Applied a total of 0 rules in 2 ms. Remains 73 /73 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2024-05-30 12:42:34] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-30 12:42:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 10/73 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 70/143 variables, 73/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/143 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 96 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1308 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 10/73 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 70/143 variables, 73/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 60/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/143 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 156 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1477 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 2801ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2803ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2811 ms. Remains : 73/73 places, 70/70 transitions.
Support contains 2 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 70/70 transitions.
Applied a total of 0 rules in 0 ms. Remains 73 /73 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2024-05-30 12:42:37] [INFO ] Invariant cache hit.
[2024-05-30 12:42:37] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-30 12:42:37] [INFO ] Invariant cache hit.
[2024-05-30 12:42:37] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-30 12:42:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 10/73 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 70/143 variables, 73/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/143 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 96 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1624 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 10/73 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 70/143 variables, 73/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 60/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/143 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 156 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1850 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 3490ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3491ms
Finished structural reductions in LTL mode , in 1 iterations and 3706 ms. Remains : 73/73 places, 70/70 transitions.
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLCardinality-12 finished in 17140 ms.
[2024-05-30 12:42:41] [INFO ] Flatten gal took : 18 ms
[2024-05-30 12:42:41] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-05-30 12:42:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 174 places, 230 transitions and 690 arcs took 7 ms.
Total runtime 210387 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running UtilityControlRoom-PT-Z2T3N10

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 174
TRANSITIONS: 230
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.006s]


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


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

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

Process ID: 1787
MODEL NAME: /home/mcc/execution/414/model
174 places, 230 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLCardinality-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717072973192

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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