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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K Apr 11 17:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 71K Apr 11 17:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 11 17:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 11 17:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 192K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Parking-PT-432-LTLFireability-00
FORMULA_NAME Parking-PT-432-LTLFireability-01
FORMULA_NAME Parking-PT-432-LTLFireability-02
FORMULA_NAME Parking-PT-432-LTLFireability-03
FORMULA_NAME Parking-PT-432-LTLFireability-04
FORMULA_NAME Parking-PT-432-LTLFireability-05
FORMULA_NAME Parking-PT-432-LTLFireability-06
FORMULA_NAME Parking-PT-432-LTLFireability-07
FORMULA_NAME Parking-PT-432-LTLFireability-08
FORMULA_NAME Parking-PT-432-LTLFireability-09
FORMULA_NAME Parking-PT-432-LTLFireability-10
FORMULA_NAME Parking-PT-432-LTLFireability-11
FORMULA_NAME Parking-PT-432-LTLFireability-12
FORMULA_NAME Parking-PT-432-LTLFireability-13
FORMULA_NAME Parking-PT-432-LTLFireability-14
FORMULA_NAME Parking-PT-432-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716663215065

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-432
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-25 18:53:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 18:53:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 18:53:38] [INFO ] Load time of PNML (sax parser for PT used): 266 ms
[2024-05-25 18:53:38] [INFO ] Transformed 529 places.
[2024-05-25 18:53:38] [INFO ] Transformed 785 transitions.
[2024-05-25 18:53:38] [INFO ] Found NUPN structural information;
[2024-05-25 18:53:38] [INFO ] Parsed PT model containing 529 places and 785 transitions and 2329 arcs in 515 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 28 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 328 transitions
Reduce redundant transitions removed 328 transitions.
FORMULA Parking-PT-432-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-432-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-432-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 529 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 457/457 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 525 transition count 453
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 525 transition count 453
Applied a total of 8 rules in 175 ms. Remains 525 /529 variables (removed 4) and now considering 453/457 (removed 4) transitions.
// Phase 1: matrix 453 rows 525 cols
[2024-05-25 18:53:38] [INFO ] Computed 124 invariants in 56 ms
[2024-05-25 18:53:39] [INFO ] Implicit Places using invariants in 1024 ms returned [64, 72, 80, 88, 96, 104, 112, 120, 144, 146, 189, 197, 205, 213, 221, 237, 245, 269, 271, 314, 322, 330, 338, 346, 354, 362, 370, 394, 396, 439, 447, 455, 463, 471, 479, 487, 495, 519, 521]
Discarding 39 places :
Implicit Place search using SMT only with invariants took 1099 ms to find 39 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 486/529 places, 453/457 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 455 transition count 422
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 455 transition count 422
Applied a total of 62 rules in 149 ms. Remains 455 /486 variables (removed 31) and now considering 422/453 (removed 31) transitions.
// Phase 1: matrix 422 rows 455 cols
[2024-05-25 18:53:40] [INFO ] Computed 85 invariants in 9 ms
[2024-05-25 18:53:40] [INFO ] Implicit Places using invariants in 520 ms returned []
[2024-05-25 18:53:40] [INFO ] Invariant cache hit.
[2024-05-25 18:53:41] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-05-25 18:53:41] [INFO ] Implicit Places using invariants and state equation in 1045 ms returned []
Implicit Place search using SMT with State Equation took 1569 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 455/529 places, 422/457 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3045 ms. Remains : 455/529 places, 422/457 transitions.
Support contains 48 out of 455 places after structural reductions.
[2024-05-25 18:53:42] [INFO ] Flatten gal took : 133 ms
[2024-05-25 18:53:42] [INFO ] Flatten gal took : 55 ms
[2024-05-25 18:53:42] [INFO ] Input system was already deterministic with 422 transitions.
Support contains 45 out of 455 places (down from 48) after GAL structural reductions.
RANDOM walk for 40000 steps (359 resets) in 2941 ms. (13 steps per ms) remains 5/30 properties
BEST_FIRST walk for 40003 steps (8 resets) in 196 ms. (203 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 5/5 properties
[2024-05-25 18:53:43] [INFO ] Invariant cache hit.
[2024-05-25 18:53:43] [INFO ] State equation strengthened by 108 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 289/299 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/299 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 156/455 variables, 77/85 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/455 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 422/877 variables, 455/540 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/877 variables, 108/648 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/877 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/877 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 877/877 variables, and 648 constraints, problems are : Problem set: 0 solved, 5 unsolved in 917 ms.
Refiners :[Positive P Invariants (semi-flows): 85/85 constraints, State Equation: 455/455 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 289/299 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/299 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 156/455 variables, 77/85 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/455 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 422/877 variables, 455/540 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/877 variables, 108/648 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/877 variables, 5/653 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/877 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/877 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 877/877 variables, and 653 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1409 ms.
Refiners :[Positive P Invariants (semi-flows): 85/85 constraints, State Equation: 455/455 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 2398ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Finished Parikh walk after 117 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=29 )
Parikh walk visited 5 properties in 977 ms.
FORMULA Parking-PT-432-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Parking-PT-432-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 4 out of 455 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 455 transition count 407
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 440 transition count 407
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 30 place count 440 transition count 391
Deduced a syphon composed of 16 places in 3 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 62 place count 424 transition count 391
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 108 place count 401 transition count 368
Applied a total of 108 rules in 163 ms. Remains 401 /455 variables (removed 54) and now considering 368/422 (removed 54) transitions.
// Phase 1: matrix 368 rows 401 cols
[2024-05-25 18:53:47] [INFO ] Computed 85 invariants in 6 ms
[2024-05-25 18:53:48] [INFO ] Implicit Places using invariants in 490 ms returned [178]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 493 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 400/455 places, 368/422 transitions.
Applied a total of 0 rules in 37 ms. Remains 400 /400 variables (removed 0) and now considering 368/368 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 695 ms. Remains : 400/455 places, 368/422 transitions.
Stuttering acceptance computed with spot in 278 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : Parking-PT-432-LTLFireability-01
Stuttering criterion allowed to conclude after 100 steps with 0 reset in 9 ms.
FORMULA Parking-PT-432-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-01 finished in 1100 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)||F(p1))))'
Support contains 5 out of 455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Applied a total of 0 rules in 12 ms. Remains 455 /455 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 455 cols
[2024-05-25 18:53:48] [INFO ] Computed 85 invariants in 5 ms
[2024-05-25 18:53:49] [INFO ] Implicit Places using invariants in 628 ms returned []
[2024-05-25 18:53:49] [INFO ] Invariant cache hit.
[2024-05-25 18:53:49] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-05-25 18:53:50] [INFO ] Implicit Places using invariants and state equation in 1425 ms returned []
Implicit Place search using SMT with State Equation took 2056 ms to find 0 implicit places.
Running 421 sub problems to find dead transitions.
[2024-05-25 18:53:50] [INFO ] Invariant cache hit.
[2024-05-25 18:53:50] [INFO ] State equation strengthened by 108 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (OVERLAPS) 1/455 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-05-25 18:54:03] [INFO ] Deduced a trap composed of 59 places in 135 ms of which 20 ms to minimize.
[2024-05-25 18:54:03] [INFO ] Deduced a trap composed of 59 places in 123 ms of which 4 ms to minimize.
[2024-05-25 18:54:04] [INFO ] Deduced a trap composed of 60 places in 61 ms of which 2 ms to minimize.
[2024-05-25 18:54:05] [INFO ] Deduced a trap composed of 59 places in 74 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 4/89 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/455 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 4 (OVERLAPS) 422/877 variables, 455/544 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/877 variables, 108/652 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 877/877 variables, and 652 constraints, problems are : Problem set: 0 solved, 421 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 85/85 constraints, State Equation: 455/455 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 421 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (OVERLAPS) 1/455 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 4/89 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/455 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 4 (OVERLAPS) 422/877 variables, 455/544 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/877 variables, 108/652 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/877 variables, 421/1073 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 877/877 variables, and 1073 constraints, problems are : Problem set: 0 solved, 421 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 85/85 constraints, State Equation: 455/455 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 4/4 constraints]
After SMT, in 60381ms problems are : Problem set: 0 solved, 421 unsolved
Search for dead transitions found 0 dead transitions in 60401ms
Finished structural reductions in LTL mode , in 1 iterations and 62492 ms. Remains : 455/455 places, 422/422 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Parking-PT-432-LTLFireability-02
Product exploration explored 100000 steps with 2085 reset in 1350 ms.
Product exploration explored 100000 steps with 2025 reset in 990 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 387 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 9 states, 29 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 558 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
RANDOM walk for 1623 steps (13 resets) in 42 ms. (37 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F p0), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 636 ms. Reduced automaton from 9 states, 29 edges and 2 AP (stutter insensitive) to 9 states, 29 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 448 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 459 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 5 out of 455 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 455 transition count 406
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 439 transition count 406
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 439 transition count 390
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 423 transition count 390
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 108 place count 401 transition count 368
Applied a total of 108 rules in 71 ms. Remains 401 /455 variables (removed 54) and now considering 368/422 (removed 54) transitions.
// Phase 1: matrix 368 rows 401 cols
[2024-05-25 18:54:56] [INFO ] Computed 85 invariants in 4 ms
[2024-05-25 18:54:56] [INFO ] Implicit Places using invariants in 404 ms returned []
[2024-05-25 18:54:56] [INFO ] Invariant cache hit.
[2024-05-25 18:54:57] [INFO ] State equation strengthened by 144 read => feed constraints.
[2024-05-25 18:54:58] [INFO ] Implicit Places using invariants and state equation in 1539 ms returned []
Implicit Place search using SMT with State Equation took 1948 ms to find 0 implicit places.
[2024-05-25 18:54:58] [INFO ] Redundant transitions in 39 ms returned []
Running 367 sub problems to find dead transitions.
[2024-05-25 18:54:58] [INFO ] Invariant cache hit.
[2024-05-25 18:54:58] [INFO ] State equation strengthened by 144 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (OVERLAPS) 1/401 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-25 18:55:07] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (OVERLAPS) 368/769 variables, 401/487 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/769 variables, 144/631 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 769/769 variables, and 631 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 85/85 constraints, State Equation: 401/401 constraints, ReadFeed: 144/144 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 367 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (OVERLAPS) 1/401 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (OVERLAPS) 368/769 variables, 401/487 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/769 variables, 144/631 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/769 variables, 367/998 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/769 variables, 0/998 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 769/769 variables, and 998 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 85/85 constraints, State Equation: 401/401 constraints, ReadFeed: 144/144 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 1/1 constraints]
After SMT, in 60172ms problems are : Problem set: 0 solved, 367 unsolved
Search for dead transitions found 0 dead transitions in 60181ms
Starting structural reductions in SI_LTL mode, iteration 1 : 401/455 places, 368/422 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62254 ms. Remains : 401/455 places, 368/422 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 366 ms. Reduced automaton from 9 states, 29 edges and 2 AP (stutter insensitive) to 9 states, 29 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 320 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
RANDOM walk for 1208 steps (9 resets) in 13 ms. (86 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p0), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 8 factoid took 740 ms. Reduced automaton from 9 states, 29 edges and 2 AP (stutter insensitive) to 9 states, 29 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 420 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 308 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 306 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 2027 reset in 636 ms.
Product exploration explored 100000 steps with 2098 reset in 708 ms.
Built C files in :
/tmp/ltsmin8354316785569784920
[2024-05-25 18:56:02] [INFO ] Computing symmetric may disable matrix : 368 transitions.
[2024-05-25 18:56:02] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 18:56:02] [INFO ] Computing symmetric may enable matrix : 368 transitions.
[2024-05-25 18:56:02] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 18:56:02] [INFO ] Computing Do-Not-Accords matrix : 368 transitions.
[2024-05-25 18:56:02] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 18:56:02] [INFO ] Built C files in 99ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8354316785569784920
Running compilation step : cd /tmp/ltsmin8354316785569784920;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1768 ms.
Running link step : cd /tmp/ltsmin8354316785569784920;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin8354316785569784920;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6617024841955544179.hoa' '--buchi-type=spotba'
LTSmin run took 3336 ms.
FORMULA Parking-PT-432-LTLFireability-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Parking-PT-432-LTLFireability-02 finished in 139010 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 455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Applied a total of 0 rules in 7 ms. Remains 455 /455 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 455 cols
[2024-05-25 18:56:07] [INFO ] Computed 85 invariants in 3 ms
[2024-05-25 18:56:08] [INFO ] Implicit Places using invariants in 493 ms returned [202]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 496 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 454/455 places, 422/422 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 453 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 453 transition count 421
Applied a total of 2 rules in 59 ms. Remains 453 /454 variables (removed 1) and now considering 421/422 (removed 1) transitions.
// Phase 1: matrix 421 rows 453 cols
[2024-05-25 18:56:08] [INFO ] Computed 84 invariants in 4 ms
[2024-05-25 18:56:08] [INFO ] Implicit Places using invariants in 560 ms returned []
[2024-05-25 18:56:08] [INFO ] Invariant cache hit.
[2024-05-25 18:56:09] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-05-25 18:56:09] [INFO ] Implicit Places using invariants and state equation in 1174 ms returned []
Implicit Place search using SMT with State Equation took 1735 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 453/455 places, 421/422 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2300 ms. Remains : 453/455 places, 421/422 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-432-LTLFireability-04
Stuttering criterion allowed to conclude after 124 steps with 0 reset in 1 ms.
FORMULA Parking-PT-432-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-04 finished in 2404 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (p1||G(!p0))))))'
Support contains 3 out of 455 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 454 transition count 405
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 438 transition count 405
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 438 transition count 389
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 422 transition count 389
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 112 place count 398 transition count 365
Applied a total of 112 rules in 66 ms. Remains 398 /455 variables (removed 57) and now considering 365/422 (removed 57) transitions.
// Phase 1: matrix 365 rows 398 cols
[2024-05-25 18:56:10] [INFO ] Computed 85 invariants in 3 ms
[2024-05-25 18:56:10] [INFO ] Implicit Places using invariants in 514 ms returned [177]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 517 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 397/455 places, 365/422 transitions.
Applied a total of 0 rules in 25 ms. Remains 397 /397 variables (removed 0) and now considering 365/365 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 609 ms. Remains : 397/455 places, 365/422 transitions.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : Parking-PT-432-LTLFireability-05
Product exploration explored 100000 steps with 966 reset in 552 ms.
Product exploration explored 100000 steps with 960 reset in 636 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 6 factoid took 230 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 175 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 11856 steps (106 resets) in 123 ms. (95 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F p0)]
Knowledge based reduction with 6 factoid took 417 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 63 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 3 out of 397 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 397/397 places, 365/365 transitions.
Applied a total of 0 rules in 19 ms. Remains 397 /397 variables (removed 0) and now considering 365/365 (removed 0) transitions.
// Phase 1: matrix 365 rows 397 cols
[2024-05-25 18:56:13] [INFO ] Computed 84 invariants in 1 ms
[2024-05-25 18:56:13] [INFO ] Implicit Places using invariants in 430 ms returned []
[2024-05-25 18:56:13] [INFO ] Invariant cache hit.
[2024-05-25 18:56:14] [INFO ] Implicit Places using invariants and state equation in 784 ms returned []
Implicit Place search using SMT with State Equation took 1216 ms to find 0 implicit places.
[2024-05-25 18:56:14] [INFO ] Redundant transitions in 17 ms returned []
Running 249 sub problems to find dead transitions.
[2024-05-25 18:56:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (OVERLAPS) 4/397 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/397 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 4 (OVERLAPS) 365/762 variables, 397/481 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/762 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 6 (OVERLAPS) 0/762 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 249 unsolved
No progress, stopping.
After SMT solving in domain Real declared 762/762 variables, and 481 constraints, problems are : Problem set: 0 solved, 249 unsolved in 23196 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 397/397 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 249 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (OVERLAPS) 4/397 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/397 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 4 (OVERLAPS) 365/762 variables, 397/481 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/762 variables, 249/730 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/762 variables, 0/730 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 7 (OVERLAPS) 0/762 variables, 0/730 constraints. Problems are: Problem set: 0 solved, 249 unsolved
No progress, stopping.
After SMT solving in domain Int declared 762/762 variables, and 730 constraints, problems are : Problem set: 0 solved, 249 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 397/397 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 0/0 constraints]
After SMT, in 53265ms problems are : Problem set: 0 solved, 249 unsolved
Search for dead transitions found 0 dead transitions in 53270ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 54532 ms. Remains : 397/397 places, 365/365 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 273 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 17122 steps (157 resets) in 151 ms. (112 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F p0)]
Knowledge based reduction with 6 factoid took 550 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 100 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 103 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 957 reset in 809 ms.
Product exploration explored 100000 steps with 964 reset in 576 ms.
Built C files in :
/tmp/ltsmin14313894686426469000
[2024-05-25 18:57:10] [INFO ] Computing symmetric may disable matrix : 365 transitions.
[2024-05-25 18:57:10] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 18:57:10] [INFO ] Computing symmetric may enable matrix : 365 transitions.
[2024-05-25 18:57:10] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 18:57:10] [INFO ] Computing Do-Not-Accords matrix : 365 transitions.
[2024-05-25 18:57:10] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 18:57:10] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14313894686426469000
Running compilation step : cd /tmp/ltsmin14313894686426469000;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1928 ms.
Running link step : cd /tmp/ltsmin14313894686426469000;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin14313894686426469000;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7452436585479172963.hoa' '--buchi-type=spotba'
LTSmin run took 3480 ms.
FORMULA Parking-PT-432-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Parking-PT-432-LTLFireability-05 finished in 65843 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X((p0 U p1)))))'
Support contains 3 out of 455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Applied a total of 0 rules in 9 ms. Remains 455 /455 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 455 cols
[2024-05-25 18:57:15] [INFO ] Computed 85 invariants in 3 ms
[2024-05-25 18:57:16] [INFO ] Implicit Places using invariants in 440 ms returned [202]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 441 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 454/455 places, 422/422 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 453 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 453 transition count 421
Applied a total of 2 rules in 20 ms. Remains 453 /454 variables (removed 1) and now considering 421/422 (removed 1) transitions.
// Phase 1: matrix 421 rows 453 cols
[2024-05-25 18:57:16] [INFO ] Computed 84 invariants in 6 ms
[2024-05-25 18:57:16] [INFO ] Implicit Places using invariants in 543 ms returned []
[2024-05-25 18:57:16] [INFO ] Invariant cache hit.
[2024-05-25 18:57:17] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-05-25 18:57:18] [INFO ] Implicit Places using invariants and state equation in 1286 ms returned []
Implicit Place search using SMT with State Equation took 1830 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 453/455 places, 421/422 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2301 ms. Remains : 453/455 places, 421/422 transitions.
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : Parking-PT-432-LTLFireability-06
Stuttering criterion allowed to conclude after 95 steps with 0 reset in 1 ms.
FORMULA Parking-PT-432-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-06 finished in 2550 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(((X(X(p0)) U p1)||F((G(p2)||p3)))))'
Support contains 5 out of 455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Applied a total of 0 rules in 6 ms. Remains 455 /455 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 455 cols
[2024-05-25 18:57:18] [INFO ] Computed 85 invariants in 3 ms
[2024-05-25 18:57:18] [INFO ] Implicit Places using invariants in 522 ms returned [202]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 524 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 454/455 places, 422/422 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 453 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 453 transition count 421
Applied a total of 2 rules in 21 ms. Remains 453 /454 variables (removed 1) and now considering 421/422 (removed 1) transitions.
// Phase 1: matrix 421 rows 453 cols
[2024-05-25 18:57:18] [INFO ] Computed 84 invariants in 3 ms
[2024-05-25 18:57:19] [INFO ] Implicit Places using invariants in 563 ms returned []
[2024-05-25 18:57:19] [INFO ] Invariant cache hit.
[2024-05-25 18:57:20] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-05-25 18:57:20] [INFO ] Implicit Places using invariants and state equation in 1405 ms returned []
Implicit Place search using SMT with State Equation took 1974 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 453/455 places, 421/422 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2528 ms. Remains : 453/455 places, 421/422 transitions.
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : Parking-PT-432-LTLFireability-07
Product exploration explored 100000 steps with 912 reset in 725 ms.
Product exploration explored 100000 steps with 916 reset in 568 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p3 (NOT p2) (NOT p0)), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (NOT p1)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 100 ms. Reduced automaton from 4 states, 8 edges and 4 AP (stutter sensitive) to 4 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p2))]
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 40000 steps (360 resets) in 668 ms. (59 steps per ms) remains 2/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 2/2 properties
[2024-05-25 18:57:23] [INFO ] Invariant cache hit.
[2024-05-25 18:57:23] [INFO ] State equation strengthened by 108 read => feed constraints.
Problem apf5 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 214/217 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 236/453 variables, 81/84 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/453 variables, 0/84 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 421/874 variables, 453/537 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/874 variables, 108/645 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/874 variables, 0/645 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/874 variables, 0/645 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 874/874 variables, and 645 constraints, problems are : Problem set: 1 solved, 1 unsolved in 351 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 453/453 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 143/145 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 308/453 variables, 82/84 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-25 18:57:23] [INFO ] Deduced a trap composed of 59 places in 117 ms of which 3 ms to minimize.
[2024-05-25 18:57:23] [INFO ] Deduced a trap composed of 59 places in 92 ms of which 2 ms to minimize.
[2024-05-25 18:57:23] [INFO ] Deduced a trap composed of 59 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/453 variables, 3/87 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/453 variables, 0/87 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 421/874 variables, 453/540 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/874 variables, 108/648 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/874 variables, 1/649 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/874 variables, 0/649 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/874 variables, 0/649 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 874/874 variables, and 649 constraints, problems are : Problem set: 1 solved, 1 unsolved in 664 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 453/453 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 1027ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 61 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=30 )
Parikh walk visited 1 properties in 1 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p3 (NOT p2) (NOT p0)), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (NOT p1)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR p1 (NOT p2) p3))]
False Knowledge obtained : [(F (NOT (OR p1 p2 p3))), (F (NOT (OR p3 p0))), (F (NOT (OR (NOT p2) p3))), (F (NOT (OR p1 p3))), (F (NOT p3)), (F p2), (F p1), (F p0), (F (NOT (OR p2 p3)))]
Knowledge based reduction with 14 factoid took 346 ms. Reduced automaton from 4 states, 8 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p2))]
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p2))]
Support contains 5 out of 453 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 453/453 places, 421/421 transitions.
Applied a total of 0 rules in 6 ms. Remains 453 /453 variables (removed 0) and now considering 421/421 (removed 0) transitions.
[2024-05-25 18:57:24] [INFO ] Invariant cache hit.
[2024-05-25 18:57:25] [INFO ] Implicit Places using invariants in 322 ms returned []
[2024-05-25 18:57:25] [INFO ] Invariant cache hit.
[2024-05-25 18:57:25] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-05-25 18:57:26] [INFO ] Implicit Places using invariants and state equation in 1120 ms returned []
Implicit Place search using SMT with State Equation took 1445 ms to find 0 implicit places.
Running 420 sub problems to find dead transitions.
[2024-05-25 18:57:26] [INFO ] Invariant cache hit.
[2024-05-25 18:57:26] [INFO ] State equation strengthened by 108 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (OVERLAPS) 1/453 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-05-25 18:57:33] [INFO ] Deduced a trap composed of 59 places in 53 ms of which 4 ms to minimize.
[2024-05-25 18:57:34] [INFO ] Deduced a trap composed of 59 places in 61 ms of which 11 ms to minimize.
[2024-05-25 18:57:34] [INFO ] Deduced a trap composed of 59 places in 48 ms of which 2 ms to minimize.
[2024-05-25 18:57:35] [INFO ] Deduced a trap composed of 59 places in 55 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/453 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/453 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (OVERLAPS) 421/874 variables, 453/541 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/874 variables, 108/649 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 874/874 variables, and 649 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 453/453 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 420 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (OVERLAPS) 1/453 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/453 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/453 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (OVERLAPS) 421/874 variables, 453/541 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/874 variables, 108/649 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/874 variables, 420/1069 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 874/874 variables, and 1069 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 453/453 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 4/4 constraints]
After SMT, in 60132ms problems are : Problem set: 0 solved, 420 unsolved
Search for dead transitions found 0 dead transitions in 60138ms
Finished structural reductions in LTL mode , in 1 iterations and 61590 ms. Remains : 453/453 places, 421/421 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p3 (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p3)))), (X p3), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 145 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[(AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p2))]
RANDOM walk for 40000 steps (362 resets) in 514 ms. (77 steps per ms) remains 1/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 1/1 properties
[2024-05-25 18:58:27] [INFO ] Invariant cache hit.
[2024-05-25 18:58:27] [INFO ] State equation strengthened by 108 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 143/145 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 308/453 variables, 82/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/453 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 421/874 variables, 453/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/874 variables, 108/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/874 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/874 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 874/874 variables, and 645 constraints, problems are : Problem set: 0 solved, 1 unsolved in 520 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 453/453 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 143/145 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 308/453 variables, 82/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-25 18:58:27] [INFO ] Deduced a trap composed of 59 places in 190 ms of which 4 ms to minimize.
[2024-05-25 18:58:28] [INFO ] Deduced a trap composed of 59 places in 124 ms of which 3 ms to minimize.
[2024-05-25 18:58:28] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/453 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/453 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 421/874 variables, 453/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/874 variables, 108/648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/874 variables, 1/649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/874 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/874 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 874/874 variables, and 649 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1162 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 453/453 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 1697ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 393 steps, including 6 resets, run visited all 1 properties in 6 ms. (steps per millisecond=65 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [(AND (NOT p1) p3 (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p3)))), (X p3), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p3 p2))), (F (NOT (OR p3 p0))), (F p0), (F (NOT (OR p3 (NOT p2)))), (F (NOT (OR p1 p3))), (F (NOT p3)), (F p2), (F p1)]
Knowledge based reduction with 9 factoid took 430 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p2))]
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p2))]
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p2))]
Product exploration explored 100000 steps with 910 reset in 828 ms.
Product exploration explored 100000 steps with 916 reset in 578 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 302 ms :[(AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p2))]
Support contains 5 out of 453 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 453/453 places, 421/421 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 453 transition count 421
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 15 Pre rules applied. Total rules applied 15 place count 453 transition count 421
Deduced a syphon composed of 30 places in 1 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 30 place count 453 transition count 421
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 45 place count 438 transition count 406
Deduced a syphon composed of 15 places in 1 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 60 place count 438 transition count 406
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 81 place count 438 transition count 420
Deduced a syphon composed of 36 places in 0 ms
Applied a total of 81 rules in 131 ms. Remains 438 /453 variables (removed 15) and now considering 420/421 (removed 1) transitions.
[2024-05-25 18:58:32] [INFO ] Redundant transitions in 5 ms returned []
Running 419 sub problems to find dead transitions.
// Phase 1: matrix 420 rows 438 cols
[2024-05-25 18:58:32] [INFO ] Computed 84 invariants in 3 ms
[2024-05-25 18:58:32] [INFO ] State equation strengthened by 153 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/437 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (OVERLAPS) 1/438 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 419 unsolved
[2024-05-25 18:58:40] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-25 18:58:41] [INFO ] Deduced a trap composed of 61 places in 51 ms of which 2 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
[2024-05-25 18:58:41] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 2 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-05-25 18:58:41] [INFO ] Deduced a trap composed of 62 places in 53 ms of which 2 ms to minimize.
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
[2024-05-25 18:58:41] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 2 ms to minimize.
Problem TDEAD56 is UNSAT
[2024-05-25 18:58:41] [INFO ] Deduced a trap composed of 61 places in 45 ms of which 2 ms to minimize.
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
[2024-05-25 18:58:41] [INFO ] Deduced a trap composed of 54 places in 54 ms of which 2 ms to minimize.
[2024-05-25 18:58:41] [INFO ] Deduced a trap composed of 60 places in 53 ms of which 1 ms to minimize.
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 8/92 constraints. Problems are: Problem set: 50 solved, 369 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 0/92 constraints. Problems are: Problem set: 50 solved, 369 unsolved
At refinement iteration 4 (OVERLAPS) 420/858 variables, 438/530 constraints. Problems are: Problem set: 50 solved, 369 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/858 variables, 153/683 constraints. Problems are: Problem set: 50 solved, 369 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 1.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 1.0)
(s231 1.0)
(s232 0.0)
(s233 0.0)
(s234 1.0)
(s235 1.0)
(s236 0.0)
(s237 0.0)
(s238 1.0)
(s239 1.0)
(s240 0.0)
(s241 0.0)
(s242 1.0)
(s243 1.0)
(s244 0.0)
(s245 0.0)
(s246 1.0)
(s247 1.0)
(s248 0.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 1.0)
(s255 1.0)
(s256 0.0)
(s257 0.0)
(s258 1.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 1.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 1.0)
(s334 0.0)
(s335 1.0)
(s336 0.0)
(s337 0.0)
(s338 1.0)
(s339 1.0)
(s340 0.0)
(s341 0.0)
(s342 1.0)
(s343 1.0)
(s344 0.0)
(s345 0.0)
(s346 1.0)
(s347 1.0)
(s348 0.0)
(s349 0.0)
(s350 1.0)
(s351 1.0)
(s352 0.0)
(s353 0.0)
(s354 1.0)
(s355 1.0)
(s356 0.0)
(s357 0.0)
(s358 1.0)
(s359 1.0)
(s360 0.0)
(s361 0.0)
(s362 1.0)
(s363 1.0)
(s364 0.0)
(s365 0.0)
(s366 1.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 858/858 variables, and 683 constraints, problems are : Problem set: 50 solved, 369 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 438/438 constraints, ReadFeed: 153/153 constraints, PredecessorRefiner: 419/419 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 50 solved, 369 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 0/0 constraints. Problems are: Problem set: 50 solved, 369 unsolved
At refinement iteration 1 (OVERLAPS) 37/438 variables, 84/84 constraints. Problems are: Problem set: 50 solved, 369 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 8/92 constraints. Problems are: Problem set: 50 solved, 369 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 0/92 constraints. Problems are: Problem set: 50 solved, 369 unsolved
At refinement iteration 4 (OVERLAPS) 420/858 variables, 438/530 constraints. Problems are: Problem set: 50 solved, 369 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/858 variables, 153/683 constraints. Problems are: Problem set: 50 solved, 369 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/858 variables, 369/1052 constraints. Problems are: Problem set: 50 solved, 369 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 858/858 variables, and 1052 constraints, problems are : Problem set: 50 solved, 369 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 438/438 constraints, ReadFeed: 153/153 constraints, PredecessorRefiner: 369/419 constraints, Known Traps: 8/8 constraints]
After SMT, in 60235ms problems are : Problem set: 50 solved, 369 unsolved
Search for dead transitions found 50 dead transitions in 60245ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 438/453 places, 370/421 transitions.
Graph (complete) has 1092 edges and 438 vertex of which 402 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.4 ms
Discarding 36 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 47 ms. Remains 402 /438 variables (removed 36) and now considering 370/370 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 402/453 places, 370/421 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60442 ms. Remains : 402/453 places, 370/421 transitions.
Built C files in :
/tmp/ltsmin5254760641013756384
[2024-05-25 18:59:32] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5254760641013756384
Running compilation step : cd /tmp/ltsmin5254760641013756384;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1495 ms.
Running link step : cd /tmp/ltsmin5254760641013756384;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin5254760641013756384;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6561657322421780432.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 453 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 453/453 places, 421/421 transitions.
Applied a total of 0 rules in 7 ms. Remains 453 /453 variables (removed 0) and now considering 421/421 (removed 0) transitions.
// Phase 1: matrix 421 rows 453 cols
[2024-05-25 18:59:47] [INFO ] Computed 84 invariants in 2 ms
[2024-05-25 18:59:47] [INFO ] Implicit Places using invariants in 396 ms returned []
[2024-05-25 18:59:47] [INFO ] Invariant cache hit.
[2024-05-25 18:59:48] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-05-25 18:59:48] [INFO ] Implicit Places using invariants and state equation in 1069 ms returned []
Implicit Place search using SMT with State Equation took 1467 ms to find 0 implicit places.
Running 420 sub problems to find dead transitions.
[2024-05-25 18:59:48] [INFO ] Invariant cache hit.
[2024-05-25 18:59:48] [INFO ] State equation strengthened by 108 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (OVERLAPS) 1/453 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-05-25 19:00:00] [INFO ] Deduced a trap composed of 59 places in 70 ms of which 2 ms to minimize.
[2024-05-25 19:00:00] [INFO ] Deduced a trap composed of 59 places in 50 ms of which 1 ms to minimize.
[2024-05-25 19:00:00] [INFO ] Deduced a trap composed of 59 places in 54 ms of which 2 ms to minimize.
[2024-05-25 19:00:01] [INFO ] Deduced a trap composed of 59 places in 59 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/453 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/453 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (OVERLAPS) 421/874 variables, 453/541 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/874 variables, 108/649 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 874/874 variables, and 649 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 453/453 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 420 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (OVERLAPS) 1/453 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/453 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/453 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (OVERLAPS) 421/874 variables, 453/541 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/874 variables, 108/649 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/874 variables, 420/1069 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 874/874 variables, and 1069 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 453/453 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 4/4 constraints]
After SMT, in 60166ms problems are : Problem set: 0 solved, 420 unsolved
Search for dead transitions found 0 dead transitions in 60174ms
Finished structural reductions in LTL mode , in 1 iterations and 61651 ms. Remains : 453/453 places, 421/421 transitions.
Built C files in :
/tmp/ltsmin15076021163828945497
[2024-05-25 19:00:49] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15076021163828945497
Running compilation step : cd /tmp/ltsmin15076021163828945497;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1379 ms.
Running link step : cd /tmp/ltsmin15076021163828945497;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin15076021163828945497;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7790834332505074903.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 19:01:04] [INFO ] Flatten gal took : 53 ms
[2024-05-25 19:01:04] [INFO ] Flatten gal took : 33 ms
[2024-05-25 19:01:04] [INFO ] Time to serialize gal into /tmp/LTL10343291440937808364.gal : 10 ms
[2024-05-25 19:01:04] [INFO ] Time to serialize properties into /tmp/LTL215657464692905266.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10343291440937808364.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15469088456597524837.hoa' '-atoms' '/tmp/LTL215657464692905266.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL215657464692905266.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15469088456597524837.hoa
Detected timeout of ITS tools.
[2024-05-25 19:01:19] [INFO ] Flatten gal took : 40 ms
[2024-05-25 19:01:19] [INFO ] Flatten gal took : 25 ms
[2024-05-25 19:01:19] [INFO ] Time to serialize gal into /tmp/LTL15339069285964775750.gal : 6 ms
[2024-05-25 19:01:19] [INFO ] Time to serialize properties into /tmp/LTL18026237535859210380.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15339069285964775750.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18026237535859210380.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(((X(X("((p118==1)&&(p150==1))")))U("((p446==1)||(p226==1))"))||(F((G("(p446==1)"))||("(p368==0)"))))))
Formula 0 simplified : F(!"((p446==1)||(p226==1))" & G(!"(p368==0)" & F!"(p446==1)") & X(!"((p446==1)||(p226==1))" W X!"((p118==1)&&(p150==1))"))
Detected timeout of ITS tools.
[2024-05-25 19:01:34] [INFO ] Flatten gal took : 24 ms
[2024-05-25 19:01:34] [INFO ] Applying decomposition
[2024-05-25 19:01:34] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph18399469206620715551.txt' '-o' '/tmp/graph18399469206620715551.bin' '-w' '/tmp/graph18399469206620715551.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18399469206620715551.bin' '-l' '-1' '-v' '-w' '/tmp/graph18399469206620715551.weights' '-q' '0' '-e' '0.001'
[2024-05-25 19:01:34] [INFO ] Decomposing Gal with order
[2024-05-25 19:01:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 19:01:35] [INFO ] Removed a total of 60 redundant transitions.
[2024-05-25 19:01:35] [INFO ] Flatten gal took : 101 ms
[2024-05-25 19:01:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 15 ms.
[2024-05-25 19:01:35] [INFO ] Time to serialize gal into /tmp/LTL3764719966888513933.gal : 14 ms
[2024-05-25 19:01:35] [INFO ] Time to serialize properties into /tmp/LTL1313092664346123292.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3764719966888513933.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1313092664346123292.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(((X(X("((i1.i1.i3.u36.p118==1)&&(i1.i1.i3.u47.p150==1))")))U("((i13.i1.i0.u138.p446==1)||(i8.u70.p226==1))"))||(F((G("(i13.i1.i0....200
Formula 0 simplified : F(!"((i13.i1.i0.u138.p446==1)||(i8.u70.p226==1))" & G(!"(i11.u108.p368==0)" & F!"(i13.i1.i0.u138.p446==1)") & X(!"((i13.i1.i0.u138.p...239
Reverse transition relation is NOT exact ! Due to transitions i1.i1.i3.u47.t104, i8.u83.t70, i11.u118.t36, i13.i1.i3.u155.t2, Intersection with reachable ...225
Computing Next relation with stutter on 1.50062e+06 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
79 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.874448,39952,1,0,50144,3606,7067,86083,637,13621,99505
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-432-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property Parking-PT-432-LTLFireability-07 finished in 257833 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(p1&&X(G((p1||G(p2)))))))))'
Support contains 5 out of 455 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 454 transition count 406
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 439 transition count 406
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 30 place count 439 transition count 391
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 60 place count 424 transition count 391
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 110 place count 399 transition count 366
Applied a total of 110 rules in 53 ms. Remains 399 /455 variables (removed 56) and now considering 366/422 (removed 56) transitions.
// Phase 1: matrix 366 rows 399 cols
[2024-05-25 19:01:36] [INFO ] Computed 85 invariants in 2 ms
[2024-05-25 19:01:36] [INFO ] Implicit Places using invariants in 531 ms returned [177]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 532 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 398/455 places, 366/422 transitions.
Applied a total of 0 rules in 21 ms. Remains 398 /398 variables (removed 0) and now considering 366/366 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 606 ms. Remains : 398/455 places, 366/422 transitions.
Stuttering acceptance computed with spot in 288 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : Parking-PT-432-LTLFireability-09
Product exploration explored 100000 steps with 948 reset in 523 ms.
Product exploration explored 100000 steps with 947 reset in 611 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p2), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (OR (AND p1 (NOT p0)) (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (OR (AND p1 (NOT p0)) (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1)), (X (X (AND p1 (NOT p0) p2)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 176 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 282 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (369 resets) in 655 ms. (60 steps per ms) remains 1/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 380 ms. (104 steps per ms) remains 1/1 properties
// Phase 1: matrix 366 rows 398 cols
[2024-05-25 19:01:39] [INFO ] Computed 84 invariants in 2 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 178/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 217/400 variables, 183/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 174/574 variables, 116/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 58/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/574 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/764 variables, and 362 constraints, problems are : Problem set: 0 solved, 1 unsolved in 285 ms.
Refiners :[Positive P Invariants (semi-flows): 63/84 constraints, State Equation: 299/398 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 178/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 217/400 variables, 183/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 174/574 variables, 116/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 58/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/574 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 574/764 variables, and 363 constraints, problems are : Problem set: 0 solved, 1 unsolved in 318 ms.
Refiners :[Positive P Invariants (semi-flows): 63/84 constraints, State Equation: 299/398 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 628ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 18 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=9 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p2), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (OR (AND p1 (NOT p0)) (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (OR (AND p1 (NOT p0)) (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1)), (X (X (AND p1 (NOT p0) p2)))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p2 p1))), (F (NOT p2)), (F (NOT (AND (NOT p0) p2 p1))), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT p1)), (F p0), (F (NOT (OR p0 (NOT p2) p1)))]
Knowledge based reduction with 19 factoid took 607 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 273 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 282 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 5 out of 398 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 398/398 places, 366/366 transitions.
Applied a total of 0 rules in 22 ms. Remains 398 /398 variables (removed 0) and now considering 366/366 (removed 0) transitions.
[2024-05-25 19:01:41] [INFO ] Invariant cache hit.
[2024-05-25 19:01:41] [INFO ] Implicit Places using invariants in 515 ms returned []
[2024-05-25 19:01:41] [INFO ] Invariant cache hit.
[2024-05-25 19:01:42] [INFO ] Implicit Places using invariants and state equation in 818 ms returned []
Implicit Place search using SMT with State Equation took 1335 ms to find 0 implicit places.
[2024-05-25 19:01:42] [INFO ] Redundant transitions in 7 ms returned []
Running 250 sub problems to find dead transitions.
[2024-05-25 19:01:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (OVERLAPS) 4/398 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/398 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (OVERLAPS) 366/764 variables, 398/482 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/764 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (OVERLAPS) 0/764 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Real declared 764/764 variables, and 482 constraints, problems are : Problem set: 0 solved, 250 unsolved in 24534 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 398/398 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 250 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (OVERLAPS) 4/398 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/398 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (OVERLAPS) 366/764 variables, 398/482 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/764 variables, 250/732 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/764 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 7 (OVERLAPS) 0/764 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Int declared 764/764 variables, and 732 constraints, problems are : Problem set: 0 solved, 250 unsolved in 29704 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 398/398 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 0/0 constraints]
After SMT, in 54295ms problems are : Problem set: 0 solved, 250 unsolved
Search for dead transitions found 0 dead transitions in 54301ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 55682 ms. Remains : 398/398 places, 366/366 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (AND (NOT p0) p1)), (X (OR (AND (NOT p0) p2) (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) p2 p1))), (X (X (AND (NOT p0) p1))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p0) p2 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 128 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (368 resets) in 1097 ms. (36 steps per ms) remains 1/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
[2024-05-25 19:02:37] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 178/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 217/400 variables, 183/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 174/574 variables, 116/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 58/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/574 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/764 variables, and 362 constraints, problems are : Problem set: 0 solved, 1 unsolved in 318 ms.
Refiners :[Positive P Invariants (semi-flows): 63/84 constraints, State Equation: 299/398 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 178/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 217/400 variables, 183/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 174/574 variables, 116/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 58/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/574 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 574/764 variables, and 363 constraints, problems are : Problem set: 0 solved, 1 unsolved in 325 ms.
Refiners :[Positive P Invariants (semi-flows): 63/84 constraints, State Equation: 299/398 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 652ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 16 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=16 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (AND (NOT p0) p1)), (X (OR (AND (NOT p0) p2) (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) p2 p1))), (X (X (AND (NOT p0) p1))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p0) p2 (NOT p1)))))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p2 p1))), (F (NOT p2)), (F (NOT (AND (NOT p0) p2 p1))), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT p1)), (F p0), (F (NOT (OR p0 (NOT p2) p1)))]
Knowledge based reduction with 19 factoid took 576 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 286 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 256 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 946 reset in 764 ms.
Product exploration explored 100000 steps with 950 reset in 608 ms.
Built C files in :
/tmp/ltsmin16456475898525341476
[2024-05-25 19:02:41] [INFO ] Computing symmetric may disable matrix : 366 transitions.
[2024-05-25 19:02:41] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 19:02:41] [INFO ] Computing symmetric may enable matrix : 366 transitions.
[2024-05-25 19:02:41] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 19:02:41] [INFO ] Computing Do-Not-Accords matrix : 366 transitions.
[2024-05-25 19:02:41] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 19:02:41] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16456475898525341476
Running compilation step : cd /tmp/ltsmin16456475898525341476;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1611 ms.
Running link step : cd /tmp/ltsmin16456475898525341476;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin16456475898525341476;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14176519562780550261.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 398 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 398/398 places, 366/366 transitions.
Applied a total of 0 rules in 13 ms. Remains 398 /398 variables (removed 0) and now considering 366/366 (removed 0) transitions.
[2024-05-25 19:02:56] [INFO ] Invariant cache hit.
[2024-05-25 19:02:56] [INFO ] Implicit Places using invariants in 385 ms returned []
[2024-05-25 19:02:56] [INFO ] Invariant cache hit.
[2024-05-25 19:02:57] [INFO ] Implicit Places using invariants and state equation in 598 ms returned []
Implicit Place search using SMT with State Equation took 986 ms to find 0 implicit places.
[2024-05-25 19:02:57] [INFO ] Redundant transitions in 1 ms returned []
Running 250 sub problems to find dead transitions.
[2024-05-25 19:02:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (OVERLAPS) 4/398 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/398 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (OVERLAPS) 366/764 variables, 398/482 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/764 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (OVERLAPS) 0/764 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Real declared 764/764 variables, and 482 constraints, problems are : Problem set: 0 solved, 250 unsolved in 21977 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 398/398 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 250 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (OVERLAPS) 4/398 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/398 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (OVERLAPS) 366/764 variables, 398/482 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/764 variables, 250/732 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/764 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 7 (OVERLAPS) 0/764 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Int declared 764/764 variables, and 732 constraints, problems are : Problem set: 0 solved, 250 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 398/398 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 0/0 constraints]
After SMT, in 52029ms problems are : Problem set: 0 solved, 250 unsolved
Search for dead transitions found 0 dead transitions in 52032ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 53040 ms. Remains : 398/398 places, 366/366 transitions.
Built C files in :
/tmp/ltsmin15257107579742394681
[2024-05-25 19:03:49] [INFO ] Computing symmetric may disable matrix : 366 transitions.
[2024-05-25 19:03:49] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 19:03:49] [INFO ] Computing symmetric may enable matrix : 366 transitions.
[2024-05-25 19:03:49] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 19:03:49] [INFO ] Computing Do-Not-Accords matrix : 366 transitions.
[2024-05-25 19:03:49] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 19:03:49] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15257107579742394681
Running compilation step : cd /tmp/ltsmin15257107579742394681;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1429 ms.
Running link step : cd /tmp/ltsmin15257107579742394681;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin15257107579742394681;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4480966211731622494.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 19:04:04] [INFO ] Flatten gal took : 21 ms
[2024-05-25 19:04:04] [INFO ] Flatten gal took : 19 ms
[2024-05-25 19:04:04] [INFO ] Time to serialize gal into /tmp/LTL17294188476740868448.gal : 3 ms
[2024-05-25 19:04:04] [INFO ] Time to serialize properties into /tmp/LTL11857236999914691543.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17294188476740868448.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11634666001264428641.hoa' '-atoms' '/tmp/LTL11857236999914691543.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL11857236999914691543.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11634666001264428641.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.50062e+06 deadlock states
2 unique states visited
2 strongly connected components in search stack
3 transitions explored
2 items max in DFS search stack
1023 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,10.2908,271080,1,0,123,1.66121e+06,37,150,9534,615211,267
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-432-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Parking-PT-432-LTLFireability-09 finished in 159745 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||X(p1)))))'
Support contains 3 out of 455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Applied a total of 0 rules in 7 ms. Remains 455 /455 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 455 cols
[2024-05-25 19:04:16] [INFO ] Computed 85 invariants in 2 ms
[2024-05-25 19:04:16] [INFO ] Implicit Places using invariants in 387 ms returned [202]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 389 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 454/455 places, 422/422 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 453 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 453 transition count 421
Applied a total of 2 rules in 17 ms. Remains 453 /454 variables (removed 1) and now considering 421/422 (removed 1) transitions.
// Phase 1: matrix 421 rows 453 cols
[2024-05-25 19:04:16] [INFO ] Computed 84 invariants in 3 ms
[2024-05-25 19:04:16] [INFO ] Implicit Places using invariants in 324 ms returned []
[2024-05-25 19:04:16] [INFO ] Invariant cache hit.
[2024-05-25 19:04:17] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-05-25 19:04:17] [INFO ] Implicit Places using invariants and state equation in 1107 ms returned []
Implicit Place search using SMT with State Equation took 1439 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 453/455 places, 421/422 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1852 ms. Remains : 453/455 places, 421/422 transitions.
Stuttering acceptance computed with spot in 305 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : Parking-PT-432-LTLFireability-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Parking-PT-432-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-11 finished in 2187 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p1)) U p0))'
Support contains 3 out of 455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Applied a total of 0 rules in 12 ms. Remains 455 /455 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 455 cols
[2024-05-25 19:04:18] [INFO ] Computed 85 invariants in 3 ms
[2024-05-25 19:04:18] [INFO ] Implicit Places using invariants in 536 ms returned [202]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 537 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 454/455 places, 422/422 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 453 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 453 transition count 421
Applied a total of 2 rules in 22 ms. Remains 453 /454 variables (removed 1) and now considering 421/422 (removed 1) transitions.
// Phase 1: matrix 421 rows 453 cols
[2024-05-25 19:04:18] [INFO ] Computed 84 invariants in 3 ms
[2024-05-25 19:04:19] [INFO ] Implicit Places using invariants in 411 ms returned []
[2024-05-25 19:04:19] [INFO ] Invariant cache hit.
[2024-05-25 19:04:19] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-05-25 19:04:20] [INFO ] Implicit Places using invariants and state equation in 1208 ms returned []
Implicit Place search using SMT with State Equation took 1620 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 453/455 places, 421/422 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2191 ms. Remains : 453/455 places, 421/422 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Parking-PT-432-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Parking-PT-432-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-12 finished in 2293 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((((!X(F(p1)) U p2)&&G(p3))||p0))))'
Support contains 7 out of 455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Applied a total of 0 rules in 7 ms. Remains 455 /455 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 455 cols
[2024-05-25 19:04:20] [INFO ] Computed 85 invariants in 2 ms
[2024-05-25 19:04:20] [INFO ] Implicit Places using invariants in 377 ms returned [202]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 379 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 454/455 places, 422/422 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 453 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 453 transition count 421
Applied a total of 2 rules in 21 ms. Remains 453 /454 variables (removed 1) and now considering 421/422 (removed 1) transitions.
// Phase 1: matrix 421 rows 453 cols
[2024-05-25 19:04:20] [INFO ] Computed 84 invariants in 1 ms
[2024-05-25 19:04:21] [INFO ] Implicit Places using invariants in 458 ms returned []
[2024-05-25 19:04:21] [INFO ] Invariant cache hit.
[2024-05-25 19:04:21] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-05-25 19:04:22] [INFO ] Implicit Places using invariants and state equation in 1260 ms returned []
Implicit Place search using SMT with State Equation took 1720 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 453/455 places, 421/422 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2127 ms. Remains : 453/455 places, 421/422 transitions.
Stuttering acceptance computed with spot in 303 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (AND (NOT p0) p1 (NOT p3))]
Running random walk in product with property : Parking-PT-432-LTLFireability-13
Stuttering criterion allowed to conclude after 235 steps with 1 reset in 3 ms.
FORMULA Parking-PT-432-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-13 finished in 2456 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(p1))||p0)))'
Support contains 4 out of 455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Applied a total of 0 rules in 11 ms. Remains 455 /455 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 455 cols
[2024-05-25 19:04:22] [INFO ] Computed 85 invariants in 3 ms
[2024-05-25 19:04:23] [INFO ] Implicit Places using invariants in 495 ms returned [202]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 497 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 454/455 places, 422/422 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 453 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 453 transition count 421
Applied a total of 2 rules in 26 ms. Remains 453 /454 variables (removed 1) and now considering 421/422 (removed 1) transitions.
// Phase 1: matrix 421 rows 453 cols
[2024-05-25 19:04:23] [INFO ] Computed 84 invariants in 3 ms
[2024-05-25 19:04:24] [INFO ] Implicit Places using invariants in 551 ms returned []
[2024-05-25 19:04:24] [INFO ] Invariant cache hit.
[2024-05-25 19:04:24] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-05-25 19:04:25] [INFO ] Implicit Places using invariants and state equation in 1273 ms returned []
Implicit Place search using SMT with State Equation took 1826 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 453/455 places, 421/422 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2360 ms. Remains : 453/455 places, 421/422 transitions.
Stuttering acceptance computed with spot in 109 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Parking-PT-432-LTLFireability-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Parking-PT-432-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-15 finished in 2483 ms.
All properties solved by simple procedures.
Total runtime 647850 ms.

BK_STOP 1716663865449

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is Parking-PT-432, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r268-smll-171654406900084"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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