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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 736K
-rw-r--r-- 1 mcc users 12K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.4K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 13 03:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 13 03:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 13 03:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 13 03:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 284K May 18 16:42 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 HirschbergSinclair-PT-20-LTLCardinality-00
FORMULA_NAME HirschbergSinclair-PT-20-LTLCardinality-01
FORMULA_NAME HirschbergSinclair-PT-20-LTLCardinality-02
FORMULA_NAME HirschbergSinclair-PT-20-LTLCardinality-03
FORMULA_NAME HirschbergSinclair-PT-20-LTLCardinality-04
FORMULA_NAME HirschbergSinclair-PT-20-LTLCardinality-05
FORMULA_NAME HirschbergSinclair-PT-20-LTLCardinality-06
FORMULA_NAME HirschbergSinclair-PT-20-LTLCardinality-07
FORMULA_NAME HirschbergSinclair-PT-20-LTLCardinality-08
FORMULA_NAME HirschbergSinclair-PT-20-LTLCardinality-09
FORMULA_NAME HirschbergSinclair-PT-20-LTLCardinality-10
FORMULA_NAME HirschbergSinclair-PT-20-LTLCardinality-11
FORMULA_NAME HirschbergSinclair-PT-20-LTLCardinality-12
FORMULA_NAME HirschbergSinclair-PT-20-LTLCardinality-13
FORMULA_NAME HirschbergSinclair-PT-20-LTLCardinality-14
FORMULA_NAME HirschbergSinclair-PT-20-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717240605935

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:16:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 11:16:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:16:49] [INFO ] Load time of PNML (sax parser for PT used): 341 ms
[2024-06-01 11:16:49] [INFO ] Transformed 530 places.
[2024-06-01 11:16:49] [INFO ] Transformed 485 transitions.
[2024-06-01 11:16:49] [INFO ] Parsed PT model containing 530 places and 485 transitions and 1479 arcs in 795 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 41 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA HirschbergSinclair-PT-20-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-20-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-20-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-20-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 530 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 530/530 places, 485/485 transitions.
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 511 transition count 485
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 36 place count 494 transition count 468
Iterating global reduction 1 with 17 rules applied. Total rules applied 53 place count 494 transition count 468
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 68 place count 479 transition count 453
Iterating global reduction 1 with 15 rules applied. Total rules applied 83 place count 479 transition count 453
Applied a total of 83 rules in 463 ms. Remains 479 /530 variables (removed 51) and now considering 453/485 (removed 32) transitions.
// Phase 1: matrix 453 rows 479 cols
[2024-06-01 11:16:51] [INFO ] Computed 26 invariants in 45 ms
[2024-06-01 11:16:52] [INFO ] Implicit Places using invariants in 1611 ms returned []
[2024-06-01 11:16:52] [INFO ] Invariant cache hit.
[2024-06-01 11:16:56] [INFO ] Implicit Places using invariants and state equation in 3377 ms returned []
Implicit Place search using SMT with State Equation took 5149 ms to find 0 implicit places.
Running 433 sub problems to find dead transitions.
[2024-06-01 11:16:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 2 (OVERLAPS) 2/460 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/460 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 4 (OVERLAPS) 19/479 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 433 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 479/932 variables, and 26 constraints, problems are : Problem set: 0 solved, 433 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/479 constraints, PredecessorRefiner: 433/433 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 433 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 2 (OVERLAPS) 2/460 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/460 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 4 (OVERLAPS) 19/479 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/479 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 6 (OVERLAPS) 453/932 variables, 479/505 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/932 variables, 433/938 constraints. Problems are: Problem set: 0 solved, 433 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 932/932 variables, and 938 constraints, problems are : Problem set: 0 solved, 433 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 479/479 constraints, PredecessorRefiner: 433/433 constraints, Known Traps: 0/0 constraints]
After SMT, in 60892ms problems are : Problem set: 0 solved, 433 unsolved
Search for dead transitions found 0 dead transitions in 60969ms
Starting structural reductions in LTL mode, iteration 1 : 479/530 places, 453/485 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66674 ms. Remains : 479/530 places, 453/485 transitions.
Support contains 44 out of 479 places after structural reductions.
[2024-06-01 11:17:57] [INFO ] Flatten gal took : 209 ms
[2024-06-01 11:17:57] [INFO ] Flatten gal took : 98 ms
[2024-06-01 11:17:58] [INFO ] Input system was already deterministic with 453 transitions.
RANDOM walk for 40000 steps (80 resets) in 2833 ms. (14 steps per ms) remains 10/28 properties
BEST_FIRST walk for 40004 steps (11 resets) in 610 ms. (65 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (10 resets) in 307 ms. (129 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (12 resets) in 174 ms. (228 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (12 resets) in 305 ms. (130 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (10 resets) in 153 ms. (259 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (10 resets) in 206 ms. (193 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (10 resets) in 128 ms. (310 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (9 resets) in 243 ms. (163 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (11 resets) in 115 ms. (344 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (11 resets) in 94 ms. (421 steps per ms) remains 10/10 properties
[2024-06-01 11:18:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 407/419 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/419 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 3/422 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/422 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 17/439 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp27 is UNSAT
After SMT solving in domain Real declared 892/932 variables, and 465 constraints, problems are : Problem set: 10 solved, 0 unsolved in 2582 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 439/479 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 2644ms problems are : Problem set: 10 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 10 atomic propositions for a total of 12 simplifications.
FORMULA HirschbergSinclair-PT-20-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 479 stabilizing places and 453 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 479 transition count 453
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA HirschbergSinclair-PT-20-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-20-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(p0&&G(F(p1)))))))'
Support contains 4 out of 479 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 479/479 places, 453/453 transitions.
Graph (complete) has 911 edges and 479 vertex of which 478 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 20 places and 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 0 with 197 rules applied. Total rules applied 198 place count 458 transition count 236
Reduce places removed 197 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 198 rules applied. Total rules applied 396 place count 261 transition count 235
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 397 place count 260 transition count 235
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 402 place count 255 transition count 230
Iterating global reduction 3 with 5 rules applied. Total rules applied 407 place count 255 transition count 230
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 409 place count 255 transition count 228
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 411 place count 253 transition count 228
Applied a total of 411 rules in 147 ms. Remains 253 /479 variables (removed 226) and now considering 228/453 (removed 225) transitions.
// Phase 1: matrix 228 rows 253 cols
[2024-06-01 11:18:03] [INFO ] Computed 25 invariants in 5 ms
[2024-06-01 11:18:04] [INFO ] Implicit Places using invariants in 990 ms returned []
[2024-06-01 11:18:04] [INFO ] Invariant cache hit.
[2024-06-01 11:18:05] [INFO ] Implicit Places using invariants and state equation in 730 ms returned []
Implicit Place search using SMT with State Equation took 1723 ms to find 0 implicit places.
[2024-06-01 11:18:05] [INFO ] Redundant transitions in 17 ms returned []
Running 189 sub problems to find dead transitions.
[2024-06-01 11:18:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/214 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 2/216 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (OVERLAPS) 191/407 variables, 216/241 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/407 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (OVERLAPS) 0/407 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/481 variables, and 241 constraints, problems are : Problem set: 0 solved, 189 unsolved in 15996 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 216/253 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/214 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 2/216 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (OVERLAPS) 191/407 variables, 216/241 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/407 variables, 189/430 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (OVERLAPS) 0/407 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Int declared 407/481 variables, and 430 constraints, problems are : Problem set: 0 solved, 189 unsolved in 14782 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 216/253 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints]
After SMT, in 30853ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 30857ms
Starting structural reductions in SI_LTL mode, iteration 1 : 253/479 places, 228/453 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32757 ms. Remains : 253/479 places, 228/453 transitions.
Stuttering acceptance computed with spot in 290 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-20-LTLCardinality-00
Product exploration explored 100000 steps with 448 reset in 761 ms.
Product exploration explored 100000 steps with 448 reset in 537 ms.
Computed a total of 253 stabilizing places and 228 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 253 transition count 228
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 115 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-20-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-20-LTLCardinality-00 finished in 34912 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 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 453/453 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 478 transition count 453
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 473 transition count 448
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 473 transition count 448
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 470 transition count 445
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 470 transition count 445
Applied a total of 17 rules in 37 ms. Remains 470 /479 variables (removed 9) and now considering 445/453 (removed 8) transitions.
// Phase 1: matrix 445 rows 470 cols
[2024-06-01 11:18:38] [INFO ] Computed 25 invariants in 5 ms
[2024-06-01 11:18:39] [INFO ] Implicit Places using invariants in 659 ms returned []
[2024-06-01 11:18:39] [INFO ] Invariant cache hit.
[2024-06-01 11:18:41] [INFO ] Implicit Places using invariants and state equation in 2188 ms returned []
Implicit Place search using SMT with State Equation took 2859 ms to find 0 implicit places.
Running 425 sub problems to find dead transitions.
[2024-06-01 11:18:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/450 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/450 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (OVERLAPS) 20/470 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (OVERLAPS) 445/915 variables, 470/495 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 915/915 variables, and 495 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 470/470 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 425 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/450 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/450 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (OVERLAPS) 20/470 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (OVERLAPS) 445/915 variables, 470/495 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/915 variables, 425/920 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 915/915 variables, and 920 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 470/470 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 0/0 constraints]
After SMT, in 60285ms problems are : Problem set: 0 solved, 425 unsolved
Search for dead transitions found 0 dead transitions in 60293ms
Starting structural reductions in LTL mode, iteration 1 : 470/479 places, 445/453 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63207 ms. Remains : 470/479 places, 445/453 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-20-LTLCardinality-01
Product exploration explored 100000 steps with 509 reset in 299 ms.
Product exploration explored 100000 steps with 509 reset in 354 ms.
Computed a total of 470 stabilizing places and 445 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 470 transition count 445
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 118 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 88 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 780 steps (0 resets) in 8 ms. (86 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 181 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 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
[2024-06-01 11:19:43] [INFO ] Invariant cache hit.
[2024-06-01 11:19:43] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 99 ms returned sat
[2024-06-01 11:19:46] [INFO ] [Real]Absence check using state equation in 2410 ms returned sat
[2024-06-01 11:19:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:19:46] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 83 ms returned sat
[2024-06-01 11:19:49] [INFO ] [Nat]Absence check using state equation in 2398 ms returned sat
[2024-06-01 11:19:49] [INFO ] Computed and/alt/rep : 205/210/205 causal constraints (skipped 220 transitions) in 37 ms.
[2024-06-01 11:19:50] [INFO ] Added : 84 causal constraints over 17 iterations in 1573 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 470 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 470/470 places, 445/445 transitions.
Reduce places removed 20 places and 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 0 with 197 rules applied. Total rules applied 197 place count 450 transition count 228
Reduce places removed 197 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 198 rules applied. Total rules applied 395 place count 253 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 396 place count 252 transition count 227
Applied a total of 396 rules in 43 ms. Remains 252 /470 variables (removed 218) and now considering 227/445 (removed 218) transitions.
// Phase 1: matrix 227 rows 252 cols
[2024-06-01 11:19:50] [INFO ] Computed 25 invariants in 3 ms
[2024-06-01 11:19:51] [INFO ] Implicit Places using invariants in 539 ms returned []
[2024-06-01 11:19:51] [INFO ] Invariant cache hit.
[2024-06-01 11:19:52] [INFO ] Implicit Places using invariants and state equation in 1017 ms returned []
Implicit Place search using SMT with State Equation took 1562 ms to find 0 implicit places.
[2024-06-01 11:19:52] [INFO ] Redundant transitions in 16 ms returned []
Running 188 sub problems to find dead transitions.
[2024-06-01 11:19:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/213 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (OVERLAPS) 2/215 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (OVERLAPS) 190/405 variables, 215/240 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (OVERLAPS) 0/405 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Real declared 405/479 variables, and 240 constraints, problems are : Problem set: 0 solved, 188 unsolved in 14096 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 215/252 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/213 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (OVERLAPS) 2/215 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (OVERLAPS) 190/405 variables, 215/240 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 188/428 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (OVERLAPS) 0/405 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Int declared 405/479 variables, and 428 constraints, problems are : Problem set: 0 solved, 188 unsolved in 16465 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 215/252 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 0/0 constraints]
After SMT, in 30597ms problems are : Problem set: 0 solved, 188 unsolved
Search for dead transitions found 0 dead transitions in 30602ms
Starting structural reductions in SI_LTL mode, iteration 1 : 252/470 places, 227/445 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32235 ms. Remains : 252/470 places, 227/445 transitions.
Computed a total of 252 stabilizing places and 227 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 252 transition count 227
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 128 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 402 steps (0 resets) in 7 ms. (50 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 148 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 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
[2024-06-01 11:20:23] [INFO ] Invariant cache hit.
[2024-06-01 11:20:23] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 64 ms returned sat
[2024-06-01 11:20:24] [INFO ] [Real]Absence check using state equation in 833 ms returned sat
[2024-06-01 11:20:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:20:25] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 68 ms returned sat
[2024-06-01 11:20:25] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2024-06-01 11:20:25] [INFO ] Computed and/alt/rep : 188/194/188 causal constraints (skipped 0 transitions) in 18 ms.
[2024-06-01 11:20:25] [INFO ] Added : 46 causal constraints over 10 iterations in 224 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1087 reset in 250 ms.
Product exploration explored 100000 steps with 1087 reset in 477 ms.
Support contains 2 out of 252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 252/252 places, 227/227 transitions.
Applied a total of 0 rules in 19 ms. Remains 252 /252 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2024-06-01 11:20:26] [INFO ] Invariant cache hit.
[2024-06-01 11:20:26] [INFO ] Implicit Places using invariants in 342 ms returned []
[2024-06-01 11:20:26] [INFO ] Invariant cache hit.
[2024-06-01 11:20:27] [INFO ] Implicit Places using invariants and state equation in 741 ms returned []
Implicit Place search using SMT with State Equation took 1087 ms to find 0 implicit places.
[2024-06-01 11:20:27] [INFO ] Redundant transitions in 5 ms returned []
Running 188 sub problems to find dead transitions.
[2024-06-01 11:20:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/213 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (OVERLAPS) 2/215 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (OVERLAPS) 190/405 variables, 215/240 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (OVERLAPS) 0/405 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Real declared 405/479 variables, and 240 constraints, problems are : Problem set: 0 solved, 188 unsolved in 12631 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 215/252 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/213 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (OVERLAPS) 2/215 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (OVERLAPS) 190/405 variables, 215/240 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 188/428 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (OVERLAPS) 0/405 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Int declared 405/479 variables, and 428 constraints, problems are : Problem set: 0 solved, 188 unsolved in 15967 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 215/252 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 0/0 constraints]
After SMT, in 28630ms problems are : Problem set: 0 solved, 188 unsolved
Search for dead transitions found 0 dead transitions in 28635ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 29754 ms. Remains : 252/252 places, 227/227 transitions.
Treatment of property HirschbergSinclair-PT-20-LTLCardinality-01 finished in 137952 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||(p1&&G(p2))))))'
Support contains 5 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 453/453 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 478 transition count 453
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 475 transition count 450
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 475 transition count 450
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 473 transition count 448
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 473 transition count 448
Applied a total of 11 rules in 53 ms. Remains 473 /479 variables (removed 6) and now considering 448/453 (removed 5) transitions.
// Phase 1: matrix 448 rows 473 cols
[2024-06-01 11:20:56] [INFO ] Computed 25 invariants in 4 ms
[2024-06-01 11:20:56] [INFO ] Implicit Places using invariants in 355 ms returned []
[2024-06-01 11:20:56] [INFO ] Invariant cache hit.
[2024-06-01 11:20:58] [INFO ] Implicit Places using invariants and state equation in 2130 ms returned []
Implicit Place search using SMT with State Equation took 2494 ms to find 0 implicit places.
Running 428 sub problems to find dead transitions.
[2024-06-01 11:20:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/453 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/453 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 2 (OVERLAPS) 20/473 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 4 (OVERLAPS) 448/921 variables, 473/498 constraints. Problems are: Problem set: 0 solved, 428 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 921/921 variables, and 498 constraints, problems are : Problem set: 0 solved, 428 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 428/428 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 428 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/453 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/453 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 2 (OVERLAPS) 20/473 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 4 (OVERLAPS) 448/921 variables, 473/498 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/921 variables, 428/926 constraints. Problems are: Problem set: 0 solved, 428 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 921/921 variables, and 926 constraints, problems are : Problem set: 0 solved, 428 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 428/428 constraints, Known Traps: 0/0 constraints]
After SMT, in 60251ms problems are : Problem set: 0 solved, 428 unsolved
Search for dead transitions found 0 dead transitions in 60263ms
Starting structural reductions in LTL mode, iteration 1 : 473/479 places, 448/453 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62818 ms. Remains : 473/479 places, 448/453 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : HirschbergSinclair-PT-20-LTLCardinality-02
Product exploration explored 100000 steps with 206 reset in 364 ms.
Product exploration explored 100000 steps with 206 reset in 362 ms.
Computed a total of 473 stabilizing places and 448 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 473 transition count 448
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X p0), (X p1), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X p1)), (F (G p0)), (F (G p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 22 factoid took 19 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-20-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-20-LTLCardinality-02 finished in 64013 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(p1)))'
Support contains 4 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 453/453 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 478 transition count 453
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 473 transition count 448
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 473 transition count 448
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 470 transition count 445
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 470 transition count 445
Applied a total of 17 rules in 33 ms. Remains 470 /479 variables (removed 9) and now considering 445/453 (removed 8) transitions.
// Phase 1: matrix 445 rows 470 cols
[2024-06-01 11:22:00] [INFO ] Computed 25 invariants in 4 ms
[2024-06-01 11:22:00] [INFO ] Implicit Places using invariants in 314 ms returned []
[2024-06-01 11:22:00] [INFO ] Invariant cache hit.
[2024-06-01 11:22:02] [INFO ] Implicit Places using invariants and state equation in 1536 ms returned []
Implicit Place search using SMT with State Equation took 1863 ms to find 0 implicit places.
Running 425 sub problems to find dead transitions.
[2024-06-01 11:22:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/450 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/450 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (OVERLAPS) 20/470 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (OVERLAPS) 445/915 variables, 470/495 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 915/915 variables, and 495 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 470/470 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 425 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/450 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/450 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (OVERLAPS) 20/470 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (OVERLAPS) 445/915 variables, 470/495 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/915 variables, 425/920 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 915/915 variables, and 920 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 470/470 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 0/0 constraints]
After SMT, in 60163ms problems are : Problem set: 0 solved, 425 unsolved
Search for dead transitions found 0 dead transitions in 60167ms
Starting structural reductions in LTL mode, iteration 1 : 470/479 places, 445/453 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62064 ms. Remains : 470/479 places, 445/453 transitions.
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-20-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 359 ms.
Product exploration explored 100000 steps with 50000 reset in 334 ms.
Computed a total of 470 stabilizing places and 445 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 470 transition count 445
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X p0), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 21 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-20-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-20-LTLCardinality-03 finished in 63137 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 3 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 453/453 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 478 transition count 453
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 473 transition count 448
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 473 transition count 448
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 470 transition count 445
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 470 transition count 445
Applied a total of 17 rules in 31 ms. Remains 470 /479 variables (removed 9) and now considering 445/453 (removed 8) transitions.
[2024-06-01 11:23:03] [INFO ] Invariant cache hit.
[2024-06-01 11:23:03] [INFO ] Implicit Places using invariants in 569 ms returned []
[2024-06-01 11:23:03] [INFO ] Invariant cache hit.
[2024-06-01 11:23:06] [INFO ] Implicit Places using invariants and state equation in 2450 ms returned []
Implicit Place search using SMT with State Equation took 3021 ms to find 0 implicit places.
Running 425 sub problems to find dead transitions.
[2024-06-01 11:23:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/450 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/450 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (OVERLAPS) 20/470 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (OVERLAPS) 445/915 variables, 470/495 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 915/915 variables, and 495 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 470/470 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 425 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/450 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/450 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (OVERLAPS) 20/470 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (OVERLAPS) 445/915 variables, 470/495 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/915 variables, 425/920 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 915/915 variables, and 920 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30037 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 470/470 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 0/0 constraints]
After SMT, in 60193ms problems are : Problem set: 0 solved, 425 unsolved
Search for dead transitions found 0 dead transitions in 60199ms
Starting structural reductions in LTL mode, iteration 1 : 470/479 places, 445/453 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63255 ms. Remains : 470/479 places, 445/453 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-20-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-20-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-20-LTLCardinality-08 finished in 63360 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 453/453 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 475 transition count 449
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 475 transition count 449
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 473 transition count 447
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 473 transition count 447
Applied a total of 12 rules in 31 ms. Remains 473 /479 variables (removed 6) and now considering 447/453 (removed 6) transitions.
// Phase 1: matrix 447 rows 473 cols
[2024-06-01 11:24:06] [INFO ] Computed 26 invariants in 4 ms
[2024-06-01 11:24:07] [INFO ] Implicit Places using invariants in 596 ms returned []
[2024-06-01 11:24:07] [INFO ] Invariant cache hit.
[2024-06-01 11:24:09] [INFO ] Implicit Places using invariants and state equation in 2234 ms returned []
Implicit Place search using SMT with State Equation took 2865 ms to find 0 implicit places.
Running 427 sub problems to find dead transitions.
[2024-06-01 11:24:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (OVERLAPS) 2/454 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (OVERLAPS) 19/473 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 473/920 variables, and 26 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/473 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 427 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (OVERLAPS) 2/454 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (OVERLAPS) 19/473 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 6 (OVERLAPS) 447/920 variables, 473/499 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/920 variables, 427/926 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 920/920 variables, and 926 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 0/0 constraints]
After SMT, in 60172ms problems are : Problem set: 0 solved, 427 unsolved
Search for dead transitions found 0 dead transitions in 60178ms
Starting structural reductions in LTL mode, iteration 1 : 473/479 places, 447/453 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63076 ms. Remains : 473/479 places, 447/453 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-20-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-20-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-20-LTLCardinality-10 finished in 63222 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 2 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 453/453 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 478 transition count 453
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 474 transition count 449
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 474 transition count 449
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 472 transition count 447
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 472 transition count 447
Applied a total of 13 rules in 51 ms. Remains 472 /479 variables (removed 7) and now considering 447/453 (removed 6) transitions.
// Phase 1: matrix 447 rows 472 cols
[2024-06-01 11:25:10] [INFO ] Computed 25 invariants in 6 ms
[2024-06-01 11:25:10] [INFO ] Implicit Places using invariants in 531 ms returned []
[2024-06-01 11:25:10] [INFO ] Invariant cache hit.
[2024-06-01 11:25:12] [INFO ] Implicit Places using invariants and state equation in 2413 ms returned []
Implicit Place search using SMT with State Equation took 2948 ms to find 0 implicit places.
Running 427 sub problems to find dead transitions.
[2024-06-01 11:25:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (OVERLAPS) 20/472 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (OVERLAPS) 447/919 variables, 472/497 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 919/919 variables, and 497 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 427 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (OVERLAPS) 20/472 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (OVERLAPS) 447/919 variables, 472/497 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/919 variables, 427/924 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 919/919 variables, and 924 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 0/0 constraints]
After SMT, in 60169ms problems are : Problem set: 0 solved, 427 unsolved
Search for dead transitions found 0 dead transitions in 60175ms
Starting structural reductions in LTL mode, iteration 1 : 472/479 places, 447/453 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63177 ms. Remains : 472/479 places, 447/453 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-20-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-20-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-20-LTLCardinality-11 finished in 63328 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 453/453 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 478 transition count 453
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 473 transition count 448
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 473 transition count 448
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 470 transition count 445
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 470 transition count 445
Applied a total of 17 rules in 52 ms. Remains 470 /479 variables (removed 9) and now considering 445/453 (removed 8) transitions.
// Phase 1: matrix 445 rows 470 cols
[2024-06-01 11:26:13] [INFO ] Computed 25 invariants in 4 ms
[2024-06-01 11:26:13] [INFO ] Implicit Places using invariants in 515 ms returned []
[2024-06-01 11:26:13] [INFO ] Invariant cache hit.
[2024-06-01 11:26:16] [INFO ] Implicit Places using invariants and state equation in 2319 ms returned []
Implicit Place search using SMT with State Equation took 2836 ms to find 0 implicit places.
Running 425 sub problems to find dead transitions.
[2024-06-01 11:26:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/450 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/450 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (OVERLAPS) 20/470 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (OVERLAPS) 445/915 variables, 470/495 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 915/915 variables, and 495 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 470/470 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 425 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/450 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/450 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (OVERLAPS) 20/470 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (OVERLAPS) 445/915 variables, 470/495 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/915 variables, 425/920 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 915/915 variables, and 920 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 470/470 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 0/0 constraints]
After SMT, in 60214ms problems are : Problem set: 0 solved, 425 unsolved
Search for dead transitions found 0 dead transitions in 60221ms
Starting structural reductions in LTL mode, iteration 1 : 470/479 places, 445/453 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63111 ms. Remains : 470/479 places, 445/453 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-20-LTLCardinality-12
Product exploration explored 100000 steps with 243 reset in 356 ms.
Product exploration explored 100000 steps with 242 reset in 424 ms.
Computed a total of 470 stabilizing places and 445 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 470 transition count 445
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 127 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 145 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 1648 steps (0 resets) in 11 ms. (137 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 144 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 144 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 11:27:18] [INFO ] Invariant cache hit.
[2024-06-01 11:27:19] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 124 ms returned sat
[2024-06-01 11:27:20] [INFO ] [Real]Absence check using state equation in 1195 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 3 factoid took 170 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-20-LTLCardinality-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-20-LTLCardinality-12 finished in 67121 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 2 out of 479 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 479/479 places, 453/453 transitions.
Graph (complete) has 911 edges and 479 vertex of which 478 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 19 places and 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 200 place count 459 transition count 235
Reduce places removed 199 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 260 transition count 234
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 401 place count 259 transition count 234
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 406 place count 254 transition count 229
Iterating global reduction 3 with 5 rules applied. Total rules applied 411 place count 254 transition count 229
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 413 place count 254 transition count 227
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 415 place count 252 transition count 227
Applied a total of 415 rules in 45 ms. Remains 252 /479 variables (removed 227) and now considering 227/453 (removed 226) transitions.
// Phase 1: matrix 227 rows 252 cols
[2024-06-01 11:27:20] [INFO ] Computed 25 invariants in 2 ms
[2024-06-01 11:27:20] [INFO ] Implicit Places using invariants in 494 ms returned []
[2024-06-01 11:27:20] [INFO ] Invariant cache hit.
[2024-06-01 11:27:21] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 11:27:22] [INFO ] Implicit Places using invariants and state equation in 1185 ms returned []
Implicit Place search using SMT with State Equation took 1682 ms to find 0 implicit places.
[2024-06-01 11:27:22] [INFO ] Redundant transitions in 5 ms returned []
Running 191 sub problems to find dead transitions.
[2024-06-01 11:27:22] [INFO ] Invariant cache hit.
[2024-06-01 11:27:22] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (OVERLAPS) 3/219 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 194/413 variables, 219/244 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 10/254 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (OVERLAPS) 0/413 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/479 variables, and 254 constraints, problems are : Problem set: 0 solved, 191 unsolved in 16779 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 219/252 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (OVERLAPS) 3/219 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 194/413 variables, 219/244 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 10/254 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 191/445 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 8 (OVERLAPS) 0/413 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Int declared 413/479 variables, and 445 constraints, problems are : Problem set: 0 solved, 191 unsolved in 12911 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 219/252 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 0/0 constraints]
After SMT, in 29720ms problems are : Problem set: 0 solved, 191 unsolved
Search for dead transitions found 0 dead transitions in 29725ms
Starting structural reductions in SI_LTL mode, iteration 1 : 252/479 places, 227/453 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31466 ms. Remains : 252/479 places, 227/453 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-20-LTLCardinality-14
Product exploration explored 100000 steps with 405 reset in 178 ms.
Stuttering criterion allowed to conclude after 58007 steps with 234 reset in 123 ms.
FORMULA HirschbergSinclair-PT-20-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-20-LTLCardinality-14 finished in 31894 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)))'
Found a Shortening insensitive property : HirschbergSinclair-PT-20-LTLCardinality-01
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 479 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 479/479 places, 453/453 transitions.
Graph (complete) has 911 edges and 479 vertex of which 478 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 20 places and 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 198 rules applied. Total rules applied 199 place count 458 transition count 235
Reduce places removed 198 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 199 rules applied. Total rules applied 398 place count 260 transition count 234
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 399 place count 259 transition count 234
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 404 place count 254 transition count 229
Iterating global reduction 3 with 5 rules applied. Total rules applied 409 place count 254 transition count 229
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 411 place count 254 transition count 227
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 413 place count 252 transition count 227
Applied a total of 413 rules in 31 ms. Remains 252 /479 variables (removed 227) and now considering 227/453 (removed 226) transitions.
// Phase 1: matrix 227 rows 252 cols
[2024-06-01 11:27:52] [INFO ] Computed 25 invariants in 1 ms
[2024-06-01 11:27:53] [INFO ] Implicit Places using invariants in 460 ms returned []
[2024-06-01 11:27:53] [INFO ] Invariant cache hit.
[2024-06-01 11:27:53] [INFO ] Implicit Places using invariants and state equation in 662 ms returned []
Implicit Place search using SMT with State Equation took 1135 ms to find 0 implicit places.
Running 188 sub problems to find dead transitions.
[2024-06-01 11:27:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/213 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (OVERLAPS) 2/215 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (OVERLAPS) 190/405 variables, 215/240 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (OVERLAPS) 0/405 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Real declared 405/479 variables, and 240 constraints, problems are : Problem set: 0 solved, 188 unsolved in 11846 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 215/252 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/213 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (OVERLAPS) 2/215 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (OVERLAPS) 190/405 variables, 215/240 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 188/428 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (OVERLAPS) 0/405 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Int declared 405/479 variables, and 428 constraints, problems are : Problem set: 0 solved, 188 unsolved in 16461 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 215/252 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 0/0 constraints]
After SMT, in 28336ms problems are : Problem set: 0 solved, 188 unsolved
Search for dead transitions found 0 dead transitions in 28338ms
Starting structural reductions in LI_LTL mode, iteration 1 : 252/479 places, 227/453 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 29507 ms. Remains : 252/479 places, 227/453 transitions.
Running random walk in product with property : HirschbergSinclair-PT-20-LTLCardinality-01
Product exploration explored 100000 steps with 1086 reset in 470 ms.
Product exploration explored 100000 steps with 1087 reset in 524 ms.
Computed a total of 252 stabilizing places and 227 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 252 transition count 227
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 95 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 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 395 steps (0 resets) in 5 ms. (65 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 127 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 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
[2024-06-01 11:28:23] [INFO ] Invariant cache hit.
[2024-06-01 11:28:23] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 51 ms returned sat
[2024-06-01 11:28:24] [INFO ] [Real]Absence check using state equation in 790 ms returned sat
[2024-06-01 11:28:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:28:25] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 92 ms returned sat
[2024-06-01 11:28:25] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2024-06-01 11:28:25] [INFO ] Computed and/alt/rep : 188/194/188 causal constraints (skipped 0 transitions) in 25 ms.
[2024-06-01 11:28:25] [INFO ] Added : 46 causal constraints over 10 iterations in 308 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 252/252 places, 227/227 transitions.
Applied a total of 0 rules in 17 ms. Remains 252 /252 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2024-06-01 11:28:25] [INFO ] Invariant cache hit.
[2024-06-01 11:28:26] [INFO ] Implicit Places using invariants in 456 ms returned []
[2024-06-01 11:28:26] [INFO ] Invariant cache hit.
[2024-06-01 11:28:27] [INFO ] Implicit Places using invariants and state equation in 1060 ms returned []
Implicit Place search using SMT with State Equation took 1527 ms to find 0 implicit places.
[2024-06-01 11:28:27] [INFO ] Redundant transitions in 2 ms returned []
Running 188 sub problems to find dead transitions.
[2024-06-01 11:28:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/213 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (OVERLAPS) 2/215 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (OVERLAPS) 190/405 variables, 215/240 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (OVERLAPS) 0/405 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Real declared 405/479 variables, and 240 constraints, problems are : Problem set: 0 solved, 188 unsolved in 14321 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 215/252 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/213 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (OVERLAPS) 2/215 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (OVERLAPS) 190/405 variables, 215/240 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 188/428 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (OVERLAPS) 0/405 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Int declared 405/479 variables, and 428 constraints, problems are : Problem set: 0 solved, 188 unsolved in 14727 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 215/252 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 0/0 constraints]
After SMT, in 29082ms problems are : Problem set: 0 solved, 188 unsolved
Search for dead transitions found 0 dead transitions in 29085ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 30640 ms. Remains : 252/252 places, 227/227 transitions.
Computed a total of 252 stabilizing places and 227 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 252 transition count 227
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 127 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 91 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 399 steps (0 resets) in 6 ms. (57 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 151 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
[2024-06-01 11:28:56] [INFO ] Invariant cache hit.
[2024-06-01 11:28:57] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 65 ms returned sat
[2024-06-01 11:28:58] [INFO ] [Real]Absence check using state equation in 1002 ms returned sat
[2024-06-01 11:28:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:28:58] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 57 ms returned sat
[2024-06-01 11:28:58] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2024-06-01 11:28:58] [INFO ] Computed and/alt/rep : 188/194/188 causal constraints (skipped 0 transitions) in 17 ms.
[2024-06-01 11:28:58] [INFO ] Added : 46 causal constraints over 10 iterations in 211 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1085 reset in 439 ms.
Product exploration explored 100000 steps with 1088 reset in 300 ms.
Support contains 2 out of 252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 252/252 places, 227/227 transitions.
Applied a total of 0 rules in 12 ms. Remains 252 /252 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2024-06-01 11:28:59] [INFO ] Invariant cache hit.
[2024-06-01 11:29:00] [INFO ] Implicit Places using invariants in 265 ms returned []
[2024-06-01 11:29:00] [INFO ] Invariant cache hit.
[2024-06-01 11:29:00] [INFO ] Implicit Places using invariants and state equation in 687 ms returned []
Implicit Place search using SMT with State Equation took 955 ms to find 0 implicit places.
[2024-06-01 11:29:00] [INFO ] Redundant transitions in 1 ms returned []
Running 188 sub problems to find dead transitions.
[2024-06-01 11:29:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/213 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (OVERLAPS) 2/215 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (OVERLAPS) 190/405 variables, 215/240 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (OVERLAPS) 0/405 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Real declared 405/479 variables, and 240 constraints, problems are : Problem set: 0 solved, 188 unsolved in 12400 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 215/252 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/213 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (OVERLAPS) 2/215 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (OVERLAPS) 190/405 variables, 215/240 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 188/428 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (OVERLAPS) 0/405 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Int declared 405/479 variables, and 428 constraints, problems are : Problem set: 0 solved, 188 unsolved in 16313 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 215/252 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 0/0 constraints]
After SMT, in 28750ms problems are : Problem set: 0 solved, 188 unsolved
Search for dead transitions found 0 dead transitions in 28754ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 29728 ms. Remains : 252/252 places, 227/227 transitions.
Treatment of property HirschbergSinclair-PT-20-LTLCardinality-01 finished in 97220 ms.
[2024-06-01 11:29:29] [INFO ] Flatten gal took : 33 ms
[2024-06-01 11:29:29] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 11:29:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 479 places, 453 transitions and 1362 arcs took 12 ms.
Total runtime 760522 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : HirschbergSinclair-PT-20-LTLCardinality-01

BK_STOP 1717241468345

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name HirschbergSinclair-PT-20-LTLCardinality-01
ltl formula formula --ltl=/tmp/1215/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 479 places, 453 transitions and 1362 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.230 real 0.050 user 0.050 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1215/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1215/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1215/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1215/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 480 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 480, there are 455 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~226 levels ~10000 states ~28900 transitions
pnml2lts-mc( 1/ 4): ~224 levels ~20000 states ~67068 transitions
pnml2lts-mc( 1/ 4): ~224 levels ~40000 states ~141340 transitions
pnml2lts-mc( 1/ 4): ~224 levels ~80000 states ~307412 transitions
pnml2lts-mc( 1/ 4): ~225 levels ~160000 states ~649036 transitions
pnml2lts-mc( 0/ 4): ~225 levels ~320000 states ~1146340 transitions
pnml2lts-mc( 0/ 4): ~225 levels ~640000 states ~2424160 transitions
pnml2lts-mc( 0/ 4): ~225 levels ~1280000 states ~5239388 transitions
pnml2lts-mc( 0/ 4): ~225 levels ~2560000 states ~11014176 transitions
pnml2lts-mc( 3/ 4): ~225 levels ~5120000 states ~22621284 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 7280183
pnml2lts-mc( 0/ 4): unique states count: 7280911
pnml2lts-mc( 0/ 4): unique transitions count: 38080261
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 30793485
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 7281255
pnml2lts-mc( 0/ 4): - cum. max stack depth: 901
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 7281255 states 38081332 transitions, fanout: 5.230
pnml2lts-mc( 0/ 4): Total exploration time 97.350 sec (97.320 sec minimum, 97.330 sec on average)
pnml2lts-mc( 0/ 4): States per second: 74795, Transitions per second: 391180
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 119.6MB, 17.2 B/state, compr.: 0.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 21.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 456 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 119.6MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HirschbergSinclair-PT-20"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is HirschbergSinclair-PT-20, 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 r500-smll-171649587400083"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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