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-171654406900092.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-832, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r268-smll-171654406900092
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 644K
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K 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.7K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 19:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 11 19:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 11 18:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 11 18:16 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 251K 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-832-LTLFireability-00
FORMULA_NAME Parking-PT-832-LTLFireability-01
FORMULA_NAME Parking-PT-832-LTLFireability-02
FORMULA_NAME Parking-PT-832-LTLFireability-03
FORMULA_NAME Parking-PT-832-LTLFireability-04
FORMULA_NAME Parking-PT-832-LTLFireability-05
FORMULA_NAME Parking-PT-832-LTLFireability-06
FORMULA_NAME Parking-PT-832-LTLFireability-07
FORMULA_NAME Parking-PT-832-LTLFireability-08
FORMULA_NAME Parking-PT-832-LTLFireability-09
FORMULA_NAME Parking-PT-832-LTLFireability-10
FORMULA_NAME Parking-PT-832-LTLFireability-11
FORMULA_NAME Parking-PT-832-LTLFireability-12
FORMULA_NAME Parking-PT-832-LTLFireability-13
FORMULA_NAME Parking-PT-832-LTLFireability-14
FORMULA_NAME Parking-PT-832-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716667499927

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-832
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-25 20:05:02] [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 20:05:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 20:05:03] [INFO ] Load time of PNML (sax parser for PT used): 338 ms
[2024-05-25 20:05:03] [INFO ] Transformed 737 places.
[2024-05-25 20:05:03] [INFO ] Transformed 993 transitions.
[2024-05-25 20:05:03] [INFO ] Found NUPN structural information;
[2024-05-25 20:05:03] [INFO ] Parsed PT model containing 737 places and 993 transitions and 2993 arcs in 610 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 35 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 384 transitions
Reduce redundant transitions removed 384 transitions.
FORMULA Parking-PT-832-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-832-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-832-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-832-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 737 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 737/737 places, 609/609 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 730 transition count 602
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 730 transition count 602
Applied a total of 14 rules in 276 ms. Remains 730 /737 variables (removed 7) and now considering 602/609 (removed 7) transitions.
// Phase 1: matrix 602 rows 730 cols
[2024-05-25 20:05:03] [INFO ] Computed 184 invariants in 61 ms
[2024-05-25 20:05:05] [INFO ] Implicit Places using invariants in 1236 ms returned [144, 152, 160, 184, 213, 221, 229, 237, 261, 263, 290, 298, 306, 314, 338, 340, 367, 375, 383, 391, 415, 417, 444, 452, 460, 468, 492, 494, 521, 529, 537, 545, 569, 571, 599, 607, 615, 623, 647, 649, 676, 684, 692, 700, 724]
Discarding 45 places :
Implicit Place search using SMT only with invariants took 1316 ms to find 45 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 685/737 places, 602/609 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 657 transition count 574
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 657 transition count 574
Applied a total of 56 rules in 111 ms. Remains 657 /685 variables (removed 28) and now considering 574/602 (removed 28) transitions.
// Phase 1: matrix 574 rows 657 cols
[2024-05-25 20:05:05] [INFO ] Computed 139 invariants in 10 ms
[2024-05-25 20:05:05] [INFO ] Implicit Places using invariants in 787 ms returned []
[2024-05-25 20:05:05] [INFO ] Invariant cache hit.
[2024-05-25 20:05:06] [INFO ] State equation strengthened by 152 read => feed constraints.
[2024-05-25 20:05:07] [INFO ] Implicit Places using invariants and state equation in 1484 ms returned []
Implicit Place search using SMT with State Equation took 2273 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 657/737 places, 574/609 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4030 ms. Remains : 657/737 places, 574/609 transitions.
Support contains 34 out of 657 places after structural reductions.
[2024-05-25 20:05:07] [INFO ] Flatten gal took : 125 ms
[2024-05-25 20:05:07] [INFO ] Flatten gal took : 60 ms
[2024-05-25 20:05:08] [INFO ] Input system was already deterministic with 574 transitions.
Reduction of identical properties reduced properties to check from 24 to 23
RANDOM walk for 40000 steps (198 resets) in 3668 ms. (10 steps per ms) remains 8/23 properties
BEST_FIRST walk for 40004 steps (8 resets) in 333 ms. (119 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 228 ms. (174 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 236 ms. (168 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 245 ms. (162 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 218 ms. (182 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 257 ms. (155 steps per ms) remains 8/8 properties
[2024-05-25 20:05:09] [INFO ] Invariant cache hit.
[2024-05-25 20:05:09] [INFO ] State equation strengthened by 152 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 289/306 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 351/657 variables, 125/139 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/657 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 574/1231 variables, 657/796 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1231 variables, 152/948 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1231 variables, 0/948 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/1231 variables, 0/948 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1231/1231 variables, and 948 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1920 ms.
Refiners :[Positive P Invariants (semi-flows): 139/139 constraints, State Equation: 657/657 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 289/306 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 351/657 variables, 125/139 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/657 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 574/1231 variables, 657/796 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1231 variables, 152/948 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1231 variables, 8/956 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1231 variables, 0/956 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/1231 variables, 0/956 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1231/1231 variables, and 956 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2537 ms.
Refiners :[Positive P Invariants (semi-flows): 139/139 constraints, State Equation: 657/657 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 4526ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 5 properties in 3605 ms.
Support contains 6 out of 657 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 657/657 places, 574/574 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 657 transition count 558
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 641 transition count 558
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 641 transition count 542
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 625 transition count 542
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 67 place count 622 transition count 539
Iterating global reduction 2 with 3 rules applied. Total rules applied 70 place count 622 transition count 539
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 130 place count 592 transition count 509
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 132 place count 591 transition count 528
Free-agglomeration rule applied 151 times.
Iterating global reduction 2 with 151 rules applied. Total rules applied 283 place count 591 transition count 377
Reduce places removed 151 places and 0 transitions.
Graph (complete) has 881 edges and 440 vertex of which 182 are kept as prefixes of interest. Removing 258 places using SCC suffix rule.2 ms
Discarding 258 places :
Also discarding 207 output transitions
Drop transitions (Output transitions of discarded places.) removed 207 transitions
Iterating post reduction 2 with 152 rules applied. Total rules applied 435 place count 182 transition count 170
Drop transitions (Empty/Sink Transition effects.) removed 30 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 3 with 34 rules applied. Total rules applied 469 place count 182 transition count 136
Applied a total of 469 rules in 224 ms. Remains 182 /657 variables (removed 475) and now considering 136/574 (removed 438) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 224 ms. Remains : 182/657 places, 136/574 transitions.
RANDOM walk for 40000 steps (8 resets) in 699 ms. (57 steps per ms) remains 1/3 properties
BEST_FIRST walk for 1864 steps (0 resets) in 8 ms. (207 steps per ms) remains 0/1 properties
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' '!(X(G(p0)))'
Support contains 2 out of 657 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 657/657 places, 574/574 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 653 transition count 570
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 653 transition count 570
Applied a total of 8 rules in 46 ms. Remains 653 /657 variables (removed 4) and now considering 570/574 (removed 4) transitions.
// Phase 1: matrix 570 rows 653 cols
[2024-05-25 20:05:18] [INFO ] Computed 139 invariants in 7 ms
[2024-05-25 20:05:19] [INFO ] Implicit Places using invariants in 578 ms returned [136, 179, 649]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 584 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 650/657 places, 570/574 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 649 transition count 569
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 649 transition count 569
Applied a total of 2 rules in 34 ms. Remains 649 /650 variables (removed 1) and now considering 569/570 (removed 1) transitions.
// Phase 1: matrix 569 rows 649 cols
[2024-05-25 20:05:19] [INFO ] Computed 136 invariants in 4 ms
[2024-05-25 20:05:20] [INFO ] Implicit Places using invariants in 528 ms returned []
[2024-05-25 20:05:20] [INFO ] Invariant cache hit.
[2024-05-25 20:05:20] [INFO ] State equation strengthened by 152 read => feed constraints.
[2024-05-25 20:05:21] [INFO ] Implicit Places using invariants and state equation in 1678 ms returned []
Implicit Place search using SMT with State Equation took 2209 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 649/657 places, 569/574 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2873 ms. Remains : 649/657 places, 569/574 transitions.
Stuttering acceptance computed with spot in 278 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-832-LTLFireability-00
Entered a terminal (fully accepting) state of product in 2919 steps with 14 reset in 128 ms.
FORMULA Parking-PT-832-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-00 finished in 3395 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(((X(p1)&&p0)||(p1&&(X(p2) U (!p3&&X(p2))))))))'
Support contains 7 out of 657 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 657/657 places, 574/574 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 653 transition count 570
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 653 transition count 570
Applied a total of 8 rules in 39 ms. Remains 653 /657 variables (removed 4) and now considering 570/574 (removed 4) transitions.
// Phase 1: matrix 570 rows 653 cols
[2024-05-25 20:05:22] [INFO ] Computed 139 invariants in 5 ms
[2024-05-25 20:05:22] [INFO ] Implicit Places using invariants in 628 ms returned [179, 649]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 631 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 651/657 places, 570/574 transitions.
Applied a total of 0 rules in 20 ms. Remains 651 /651 variables (removed 0) and now considering 570/570 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 691 ms. Remains : 651/657 places, 570/574 transitions.
Stuttering acceptance computed with spot in 642 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2)) (AND (NOT p0) p3)), (OR (NOT p1) (AND (NOT p0) (NOT p2)) (AND (NOT p0) p3)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) p2 p3) (AND (NOT p1) (NOT p2)) (AND (NOT p1) p3)), (NOT p1), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) p3))]
Running random walk in product with property : Parking-PT-832-LTLFireability-01
Stuttering criterion allowed to conclude after 189 steps with 8 reset in 8 ms.
FORMULA Parking-PT-832-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-01 finished in 1389 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(G(p0) U !p0)))'
Support contains 2 out of 657 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 657/657 places, 574/574 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 657 transition count 558
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 641 transition count 558
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 641 transition count 542
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 625 transition count 542
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 621 transition count 538
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 621 transition count 538
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 130 place count 592 transition count 509
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 134 place count 590 transition count 547
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 135 place count 590 transition count 547
Applied a total of 135 rules in 298 ms. Remains 590 /657 variables (removed 67) and now considering 547/574 (removed 27) transitions.
// Phase 1: matrix 547 rows 590 cols
[2024-05-25 20:05:23] [INFO ] Computed 139 invariants in 7 ms
[2024-05-25 20:05:24] [INFO ] Implicit Places using invariants in 830 ms returned [135, 173, 587]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 832 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 587/657 places, 547/574 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 586 transition count 546
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 586 transition count 546
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 585 transition count 545
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 584 transition count 560
Applied a total of 6 rules in 128 ms. Remains 584 /587 variables (removed 3) and now considering 560/547 (removed -13) transitions.
// Phase 1: matrix 560 rows 584 cols
[2024-05-25 20:05:24] [INFO ] Computed 136 invariants in 6 ms
[2024-05-25 20:05:25] [INFO ] Implicit Places using invariants in 762 ms returned []
[2024-05-25 20:05:25] [INFO ] Invariant cache hit.
[2024-05-25 20:05:26] [INFO ] State equation strengthened by 240 read => feed constraints.
[2024-05-25 20:05:27] [INFO ] Implicit Places using invariants and state equation in 2395 ms returned []
Implicit Place search using SMT with State Equation took 3161 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 584/657 places, 560/574 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4420 ms. Remains : 584/657 places, 560/574 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-832-LTLFireability-02
Stuttering criterion allowed to conclude after 177 steps with 0 reset in 3 ms.
FORMULA Parking-PT-832-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-02 finished in 4574 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 657 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 657/657 places, 574/574 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 657 transition count 558
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 641 transition count 558
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 641 transition count 542
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 625 transition count 542
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 621 transition count 538
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 621 transition count 538
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 132 place count 591 transition count 508
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 136 place count 589 transition count 546
Applied a total of 136 rules in 128 ms. Remains 589 /657 variables (removed 68) and now considering 546/574 (removed 28) transitions.
// Phase 1: matrix 546 rows 589 cols
[2024-05-25 20:05:28] [INFO ] Computed 139 invariants in 6 ms
[2024-05-25 20:05:28] [INFO ] Implicit Places using invariants in 636 ms returned [135, 173, 586]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 639 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 586/657 places, 546/574 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 585 transition count 545
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 585 transition count 545
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 584 transition count 544
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 583 transition count 559
Applied a total of 6 rules in 113 ms. Remains 583 /586 variables (removed 3) and now considering 559/546 (removed -13) transitions.
// Phase 1: matrix 559 rows 583 cols
[2024-05-25 20:05:28] [INFO ] Computed 136 invariants in 5 ms
[2024-05-25 20:05:29] [INFO ] Implicit Places using invariants in 536 ms returned []
[2024-05-25 20:05:29] [INFO ] Invariant cache hit.
[2024-05-25 20:05:30] [INFO ] State equation strengthened by 240 read => feed constraints.
[2024-05-25 20:05:31] [INFO ] Implicit Places using invariants and state equation in 2334 ms returned []
Implicit Place search using SMT with State Equation took 2874 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 583/657 places, 559/574 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3756 ms. Remains : 583/657 places, 559/574 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-832-LTLFireability-03
Stuttering criterion allowed to conclude after 161 steps with 0 reset in 2 ms.
FORMULA Parking-PT-832-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-03 finished in 3816 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 657 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 657/657 places, 574/574 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 657 transition count 558
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 641 transition count 558
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 641 transition count 542
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 625 transition count 542
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 621 transition count 538
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 621 transition count 538
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 132 place count 591 transition count 508
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 136 place count 589 transition count 546
Applied a total of 136 rules in 111 ms. Remains 589 /657 variables (removed 68) and now considering 546/574 (removed 28) transitions.
// Phase 1: matrix 546 rows 589 cols
[2024-05-25 20:05:32] [INFO ] Computed 139 invariants in 5 ms
[2024-05-25 20:05:32] [INFO ] Implicit Places using invariants in 603 ms returned [135, 173, 586]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 608 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 586/657 places, 546/574 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 585 transition count 545
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 585 transition count 545
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 584 transition count 544
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 583 transition count 559
Applied a total of 6 rules in 72 ms. Remains 583 /586 variables (removed 3) and now considering 559/546 (removed -13) transitions.
// Phase 1: matrix 559 rows 583 cols
[2024-05-25 20:05:32] [INFO ] Computed 136 invariants in 3 ms
[2024-05-25 20:05:33] [INFO ] Implicit Places using invariants in 478 ms returned []
[2024-05-25 20:05:33] [INFO ] Invariant cache hit.
[2024-05-25 20:05:33] [INFO ] State equation strengthened by 240 read => feed constraints.
[2024-05-25 20:05:35] [INFO ] Implicit Places using invariants and state equation in 2700 ms returned []
Implicit Place search using SMT with State Equation took 3183 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 583/657 places, 559/574 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3975 ms. Remains : 583/657 places, 559/574 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-832-LTLFireability-06
Stuttering criterion allowed to conclude after 197 steps with 0 reset in 4 ms.
FORMULA Parking-PT-832-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-06 finished in 4041 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((F(p1)&&p0))||G(p2))))'
Support contains 4 out of 657 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 657/657 places, 574/574 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 657 transition count 558
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 641 transition count 558
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 641 transition count 542
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 625 transition count 542
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 621 transition count 538
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 621 transition count 538
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 128 place count 593 transition count 510
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 132 place count 591 transition count 548
Applied a total of 132 rules in 131 ms. Remains 591 /657 variables (removed 66) and now considering 548/574 (removed 26) transitions.
// Phase 1: matrix 548 rows 591 cols
[2024-05-25 20:05:36] [INFO ] Computed 139 invariants in 6 ms
[2024-05-25 20:05:36] [INFO ] Implicit Places using invariants in 776 ms returned [135, 173, 588]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 780 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 588/657 places, 548/574 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 587 transition count 547
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 587 transition count 547
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 586 transition count 546
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 585 transition count 561
Applied a total of 6 rules in 110 ms. Remains 585 /588 variables (removed 3) and now considering 561/548 (removed -13) transitions.
// Phase 1: matrix 561 rows 585 cols
[2024-05-25 20:05:36] [INFO ] Computed 136 invariants in 5 ms
[2024-05-25 20:05:37] [INFO ] Implicit Places using invariants in 730 ms returned []
[2024-05-25 20:05:37] [INFO ] Invariant cache hit.
[2024-05-25 20:05:38] [INFO ] State equation strengthened by 238 read => feed constraints.
[2024-05-25 20:05:40] [INFO ] Implicit Places using invariants and state equation in 2406 ms returned []
Implicit Place search using SMT with State Equation took 3139 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 585/657 places, 561/574 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4161 ms. Remains : 585/657 places, 561/574 transitions.
Stuttering acceptance computed with spot in 97 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : Parking-PT-832-LTLFireability-07
Product exploration explored 100000 steps with 515 reset in 1079 ms.
Product exploration explored 100000 steps with 516 reset in 1199 ms.
Computed a total of 1 stabilizing places and 25 stable transitions
Computed a total of 1 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND p0 p2))), (X p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p0) p2)), (X p1), (X (X (NOT (AND p0 p2)))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p0) p2))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 121 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (203 resets) in 1199 ms. (33 steps per ms) remains 5/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 420 ms. (95 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 301 ms. (132 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 242 ms. (164 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 5/5 properties
[2024-05-25 20:05:43] [INFO ] Invariant cache hit.
[2024-05-25 20:05:43] [INFO ] State equation strengthened by 238 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 124/128 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 457/585 variables, 132/136 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/585 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 561/1146 variables, 585/721 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1146 variables, 238/959 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1146 variables, 0/959 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/1146 variables, 0/959 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1146/1146 variables, and 959 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1038 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 585/585 constraints, ReadFeed: 238/238 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 124/128 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 457/585 variables, 132/136 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/585 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 561/1146 variables, 585/721 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1146 variables, 238/959 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1146 variables, 5/964 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1146 variables, 0/964 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/1146 variables, 0/964 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1146/1146 variables, and 964 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1876 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 585/585 constraints, ReadFeed: 238/238 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 2958ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 1 properties in 1795 ms.
Support contains 4 out of 585 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 585/585 places, 561/561 transitions.
Free-agglomeration rule applied 157 times.
Iterating global reduction 0 with 157 rules applied. Total rules applied 157 place count 585 transition count 404
Reduce places removed 157 places and 0 transitions.
Graph (complete) has 899 edges and 428 vertex of which 232 are kept as prefixes of interest. Removing 196 places using SCC suffix rule.1 ms
Discarding 196 places :
Also discarding 156 output transitions
Drop transitions (Output transitions of discarded places.) removed 156 transitions
Iterating post reduction 0 with 158 rules applied. Total rules applied 315 place count 232 transition count 248
Drop transitions (Empty/Sink Transition effects.) removed 32 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 367 place count 232 transition count 196
Applied a total of 367 rules in 55 ms. Remains 232 /585 variables (removed 353) and now considering 196/561 (removed 365) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 232/585 places, 196/561 transitions.
RANDOM walk for 25104 steps (4 resets) in 136 ms. (183 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND p0 p2))), (X p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p0) p2)), (X p1), (X (X (NOT (AND p0 p2)))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p0) p2))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT (OR p2 p0))), (F p0), (F (NOT (OR p2 p1))), (F (NOT p2)), (F (NOT (OR (NOT p2) (NOT p0)))), (F (NOT (AND p2 (NOT p0)))), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR p2 (NOT p0)))), (F (NOT p1))]
Knowledge based reduction with 21 factoid took 389 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 110 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Support contains 4 out of 585 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 585/585 places, 561/561 transitions.
Applied a total of 0 rules in 48 ms. Remains 585 /585 variables (removed 0) and now considering 561/561 (removed 0) transitions.
[2024-05-25 20:05:49] [INFO ] Invariant cache hit.
[2024-05-25 20:05:49] [INFO ] Implicit Places using invariants in 744 ms returned []
[2024-05-25 20:05:49] [INFO ] Invariant cache hit.
[2024-05-25 20:05:50] [INFO ] State equation strengthened by 238 read => feed constraints.
[2024-05-25 20:05:52] [INFO ] Implicit Places using invariants and state equation in 2507 ms returned []
Implicit Place search using SMT with State Equation took 3255 ms to find 0 implicit places.
[2024-05-25 20:05:52] [INFO ] Redundant transitions in 44 ms returned []
Running 536 sub problems to find dead transitions.
[2024-05-25 20:05:52] [INFO ] Invariant cache hit.
[2024-05-25 20:05:52] [INFO ] State equation strengthened by 238 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 536 unsolved
At refinement iteration 1 (OVERLAPS) 1/585 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 536 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/585 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 536 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 561/1146 variables, 585/721 constraints. Problems are: Problem set: 0 solved, 536 unsolved
SMT process timed out in 31516ms, After SMT, problems are : Problem set: 0 solved, 536 unsolved
Search for dead transitions found 0 dead transitions in 31532ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 34893 ms. Remains : 585/585 places, 561/561 transitions.
Computed a total of 1 stabilizing places and 25 stable transitions
Computed a total of 1 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X p2), (X (AND p2 (NOT p0))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (X p2)), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 162 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (204 resets) in 657 ms. (60 steps per ms) remains 4/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 228 ms. (174 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 197 ms. (202 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 4/4 properties
[2024-05-25 20:06:24] [INFO ] Invariant cache hit.
[2024-05-25 20:06:24] [INFO ] State equation strengthened by 238 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 124/128 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 457/585 variables, 132/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/585 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 561/1146 variables, 585/721 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1146 variables, 238/959 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1146 variables, 0/959 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/1146 variables, 0/959 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1146/1146 variables, and 959 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1061 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 585/585 constraints, ReadFeed: 238/238 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 124/128 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 457/585 variables, 132/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/585 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 561/1146 variables, 585/721 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1146 variables, 238/959 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1146 variables, 4/963 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1146 variables, 0/963 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/1146 variables, 0/963 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1146/1146 variables, and 963 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1584 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 585/585 constraints, ReadFeed: 238/238 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 2698ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 2142 ms.
Support contains 4 out of 585 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 585/585 places, 561/561 transitions.
Free-agglomeration rule applied 157 times.
Iterating global reduction 0 with 157 rules applied. Total rules applied 157 place count 585 transition count 404
Reduce places removed 157 places and 0 transitions.
Graph (complete) has 899 edges and 428 vertex of which 232 are kept as prefixes of interest. Removing 196 places using SCC suffix rule.2 ms
Discarding 196 places :
Also discarding 156 output transitions
Drop transitions (Output transitions of discarded places.) removed 156 transitions
Iterating post reduction 0 with 158 rules applied. Total rules applied 315 place count 232 transition count 248
Drop transitions (Empty/Sink Transition effects.) removed 32 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 367 place count 232 transition count 196
Applied a total of 367 rules in 89 ms. Remains 232 /585 variables (removed 353) and now considering 196/561 (removed 365) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 232/585 places, 196/561 transitions.
RANDOM walk for 23419 steps (5 resets) in 104 ms. (223 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p2 (NOT p0) p1), (X p2), (X (AND p2 (NOT p0))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (X p2)), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p2))), (F p0), (F (NOT (OR p2 p1))), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) p2))), (F (NOT p2)), (F (NOT (AND (NOT p0) p2))), (F (NOT (OR (NOT p2) p1))), (F (NOT p1))]
Knowledge based reduction with 21 factoid took 458 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 80 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 90 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 509 reset in 1114 ms.
Product exploration explored 100000 steps with 518 reset in 874 ms.
Built C files in :
/tmp/ltsmin17598046937601992720
[2024-05-25 20:06:32] [INFO ] Computing symmetric may disable matrix : 561 transitions.
[2024-05-25 20:06:32] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:06:32] [INFO ] Computing symmetric may enable matrix : 561 transitions.
[2024-05-25 20:06:32] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:06:32] [INFO ] Computing Do-Not-Accords matrix : 561 transitions.
[2024-05-25 20:06:32] [INFO ] Computation of Completed DNA matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:06:32] [INFO ] Built C files in 125ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17598046937601992720
Running compilation step : cd /tmp/ltsmin17598046937601992720;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17598046937601992720;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17598046937601992720;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 4 out of 585 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 585/585 places, 561/561 transitions.
Applied a total of 0 rules in 40 ms. Remains 585 /585 variables (removed 0) and now considering 561/561 (removed 0) transitions.
[2024-05-25 20:06:35] [INFO ] Invariant cache hit.
[2024-05-25 20:06:36] [INFO ] Implicit Places using invariants in 574 ms returned []
[2024-05-25 20:06:36] [INFO ] Invariant cache hit.
[2024-05-25 20:06:36] [INFO ] State equation strengthened by 238 read => feed constraints.
[2024-05-25 20:06:38] [INFO ] Implicit Places using invariants and state equation in 2653 ms returned []
Implicit Place search using SMT with State Equation took 3229 ms to find 0 implicit places.
[2024-05-25 20:06:38] [INFO ] Redundant transitions in 10 ms returned []
Running 536 sub problems to find dead transitions.
[2024-05-25 20:06:38] [INFO ] Invariant cache hit.
[2024-05-25 20:06:38] [INFO ] State equation strengthened by 238 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 536 unsolved
At refinement iteration 1 (OVERLAPS) 1/585 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 536 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/585 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 536 unsolved
At refinement iteration 3 (OVERLAPS) 561/1146 variables, 585/721 constraints. Problems are: Problem set: 0 solved, 536 unsolved
SMT process timed out in 31278ms, After SMT, problems are : Problem set: 0 solved, 536 unsolved
Search for dead transitions found 0 dead transitions in 31293ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 34582 ms. Remains : 585/585 places, 561/561 transitions.
Built C files in :
/tmp/ltsmin3128464813072986055
[2024-05-25 20:07:10] [INFO ] Computing symmetric may disable matrix : 561 transitions.
[2024-05-25 20:07:10] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:07:10] [INFO ] Computing symmetric may enable matrix : 561 transitions.
[2024-05-25 20:07:10] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:07:10] [INFO ] Computing Do-Not-Accords matrix : 561 transitions.
[2024-05-25 20:07:10] [INFO ] Computation of Completed DNA matrix. took 45 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:07:10] [INFO ] Built C files in 151ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3128464813072986055
Running compilation step : cd /tmp/ltsmin3128464813072986055;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3128464813072986055;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3128464813072986055;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-25 20:07:13] [INFO ] Flatten gal took : 233 ms
[2024-05-25 20:07:13] [INFO ] Flatten gal took : 190 ms
[2024-05-25 20:07:13] [INFO ] Time to serialize gal into /tmp/LTL14560311983086236516.gal : 12 ms
[2024-05-25 20:07:14] [INFO ] Time to serialize properties into /tmp/LTL1102973770450927447.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/LTL14560311983086236516.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3495578034097210771.hoa' '-atoms' '/tmp/LTL1102973770450927447.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/LTL1102973770450927447.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3495578034097210771.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 7.8311e+10 deadlock states
Detected timeout of ITS tools.
[2024-05-25 20:07:29] [INFO ] Flatten gal took : 94 ms
[2024-05-25 20:07:29] [INFO ] Flatten gal took : 84 ms
[2024-05-25 20:07:29] [INFO ] Time to serialize gal into /tmp/LTL6395065182609584548.gal : 11 ms
[2024-05-25 20:07:29] [INFO ] Time to serialize properties into /tmp/LTL15375230306479390627.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/LTL6395065182609584548.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15375230306479390627.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...276
Read 1 LTL properties
Checking formula 0 : !((F((G(("((p70==1)&&(p480==1))")&&(F("(p600!=1)"))))||(G("(p288!=1)")))))
Formula 0 simplified : G(F(!"((p70==1)&&(p480==1))" | G!"(p600!=1)") & F!"(p288!=1)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 7.8311e+10 deadlock states
Detected timeout of ITS tools.
[2024-05-25 20:07:44] [INFO ] Flatten gal took : 96 ms
[2024-05-25 20:07:44] [INFO ] Applying decomposition
[2024-05-25 20:07:44] [INFO ] Flatten gal took : 109 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/graph8945507694423864877.txt' '-o' '/tmp/graph8945507694423864877.bin' '-w' '/tmp/graph8945507694423864877.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8945507694423864877.bin' '-l' '-1' '-v' '-w' '/tmp/graph8945507694423864877.weights' '-q' '0' '-e' '0.001'
[2024-05-25 20:07:44] [INFO ] Decomposing Gal with order
[2024-05-25 20:07:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 20:07:45] [INFO ] Removed a total of 3454 redundant transitions.
[2024-05-25 20:07:45] [INFO ] Flatten gal took : 285 ms
[2024-05-25 20:07:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 70 labels/synchronizations in 360 ms.
[2024-05-25 20:07:45] [INFO ] Time to serialize gal into /tmp/LTL6982796620238900232.gal : 28 ms
[2024-05-25 20:07:45] [INFO ] Time to serialize properties into /tmp/LTL16403603285383935500.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/LTL6982796620238900232.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16403603285383935500.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...255
Read 1 LTL properties
Checking formula 0 : !((F((G(("((i1.i1.i0.u34.p70==1)&&(i11.u164.p480==1))")&&(F("(i13.u204.p600!=1)"))))||(G("(i8.u109.p288!=1)")))))
Formula 0 simplified : G(F(!"((i1.i1.i0.u34.p70==1)&&(i11.u164.p480==1))" | G!"(i13.u204.p600!=1)") & F!"(i8.u109.p288!=1)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 7.8311e+10 deadlock states
6 unique states visited
3 strongly connected components in search stack
11 transitions explored
6 items max in DFS search stack
1032 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.4514,246048,1,0,415537,599,5880,1.47655e+06,211,1334,358875
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-832-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property Parking-PT-832-LTLFireability-07 finished in 141648 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(((p0&&F(p1))||(p2&&(p0||G(p3))))))'
Support contains 4 out of 657 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 657/657 places, 574/574 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 654 transition count 571
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 654 transition count 571
Applied a total of 6 rules in 24 ms. Remains 654 /657 variables (removed 3) and now considering 571/574 (removed 3) transitions.
// Phase 1: matrix 571 rows 654 cols
[2024-05-25 20:07:57] [INFO ] Computed 139 invariants in 5 ms
[2024-05-25 20:07:58] [INFO ] Implicit Places using invariants in 610 ms returned [136, 179, 650]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 611 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 651/657 places, 571/574 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 650 transition count 570
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 650 transition count 570
Applied a total of 2 rules in 35 ms. Remains 650 /651 variables (removed 1) and now considering 570/571 (removed 1) transitions.
// Phase 1: matrix 570 rows 650 cols
[2024-05-25 20:07:58] [INFO ] Computed 136 invariants in 3 ms
[2024-05-25 20:07:58] [INFO ] Implicit Places using invariants in 719 ms returned []
[2024-05-25 20:07:58] [INFO ] Invariant cache hit.
[2024-05-25 20:07:59] [INFO ] State equation strengthened by 152 read => feed constraints.
[2024-05-25 20:08:00] [INFO ] Implicit Places using invariants and state equation in 1863 ms returned []
Implicit Place search using SMT with State Equation took 2584 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 650/657 places, 570/574 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3256 ms. Remains : 650/657 places, 570/574 transitions.
Stuttering acceptance computed with spot in 277 ms :[true, (NOT p1), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p3), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : Parking-PT-832-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Parking-PT-832-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-08 finished in 3554 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||G(F(p1))))))'
Support contains 3 out of 657 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 657/657 places, 574/574 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 654 transition count 571
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 654 transition count 571
Applied a total of 6 rules in 36 ms. Remains 654 /657 variables (removed 3) and now considering 571/574 (removed 3) transitions.
// Phase 1: matrix 571 rows 654 cols
[2024-05-25 20:08:01] [INFO ] Computed 139 invariants in 3 ms
[2024-05-25 20:08:02] [INFO ] Implicit Places using invariants in 819 ms returned [136, 650]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 821 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 652/657 places, 571/574 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 651 transition count 570
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 651 transition count 570
Applied a total of 2 rules in 31 ms. Remains 651 /652 variables (removed 1) and now considering 570/571 (removed 1) transitions.
// Phase 1: matrix 570 rows 651 cols
[2024-05-25 20:08:02] [INFO ] Computed 137 invariants in 3 ms
[2024-05-25 20:08:02] [INFO ] Implicit Places using invariants in 714 ms returned []
[2024-05-25 20:08:02] [INFO ] Invariant cache hit.
[2024-05-25 20:08:03] [INFO ] State equation strengthened by 152 read => feed constraints.
[2024-05-25 20:08:04] [INFO ] Implicit Places using invariants and state equation in 1281 ms returned []
Implicit Place search using SMT with State Equation took 1998 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 651/657 places, 570/574 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2888 ms. Remains : 651/657 places, 570/574 transitions.
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-832-LTLFireability-10
Stuttering criterion allowed to conclude after 215 steps with 0 reset in 2 ms.
FORMULA Parking-PT-832-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-10 finished in 3027 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||X(F(p2)))))))'
Support contains 6 out of 657 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 657/657 places, 574/574 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 654 transition count 571
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 654 transition count 571
Applied a total of 6 rules in 21 ms. Remains 654 /657 variables (removed 3) and now considering 571/574 (removed 3) transitions.
// Phase 1: matrix 571 rows 654 cols
[2024-05-25 20:08:04] [INFO ] Computed 139 invariants in 1 ms
[2024-05-25 20:08:04] [INFO ] Implicit Places using invariants in 464 ms returned [136, 179]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 467 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 652/657 places, 571/574 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 651 transition count 570
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 651 transition count 570
Applied a total of 2 rules in 20 ms. Remains 651 /652 variables (removed 1) and now considering 570/571 (removed 1) transitions.
// Phase 1: matrix 570 rows 651 cols
[2024-05-25 20:08:04] [INFO ] Computed 137 invariants in 2 ms
[2024-05-25 20:08:05] [INFO ] Implicit Places using invariants in 680 ms returned []
[2024-05-25 20:08:05] [INFO ] Invariant cache hit.
[2024-05-25 20:08:06] [INFO ] State equation strengthened by 152 read => feed constraints.
[2024-05-25 20:08:07] [INFO ] Implicit Places using invariants and state equation in 2221 ms returned []
Implicit Place search using SMT with State Equation took 2904 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 651/657 places, 570/574 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3412 ms. Remains : 651/657 places, 570/574 transitions.
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : Parking-PT-832-LTLFireability-11
Product exploration explored 100000 steps with 33333 reset in 2658 ms.
Product exploration explored 100000 steps with 33333 reset in 2020 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) p2 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 16 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Parking-PT-832-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-832-LTLFireability-11 finished in 8309 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 657 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 657/657 places, 574/574 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 653 transition count 570
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 653 transition count 570
Applied a total of 8 rules in 20 ms. Remains 653 /657 variables (removed 4) and now considering 570/574 (removed 4) transitions.
// Phase 1: matrix 570 rows 653 cols
[2024-05-25 20:08:12] [INFO ] Computed 139 invariants in 2 ms
[2024-05-25 20:08:13] [INFO ] Implicit Places using invariants in 499 ms returned [136, 179, 649]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 500 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 650/657 places, 570/574 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 649 transition count 569
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 649 transition count 569
Applied a total of 2 rules in 20 ms. Remains 649 /650 variables (removed 1) and now considering 569/570 (removed 1) transitions.
// Phase 1: matrix 569 rows 649 cols
[2024-05-25 20:08:13] [INFO ] Computed 136 invariants in 1 ms
[2024-05-25 20:08:13] [INFO ] Implicit Places using invariants in 729 ms returned []
[2024-05-25 20:08:13] [INFO ] Invariant cache hit.
[2024-05-25 20:08:14] [INFO ] State equation strengthened by 152 read => feed constraints.
[2024-05-25 20:08:15] [INFO ] Implicit Places using invariants and state equation in 2204 ms returned []
Implicit Place search using SMT with State Equation took 2934 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 649/657 places, 569/574 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3474 ms. Remains : 649/657 places, 569/574 transitions.
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-832-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Parking-PT-832-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-13 finished in 3604 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 3 out of 657 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 657/657 places, 574/574 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 656 transition count 558
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 641 transition count 558
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 641 transition count 543
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 626 transition count 543
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 64 place count 622 transition count 539
Iterating global reduction 2 with 4 rules applied. Total rules applied 68 place count 622 transition count 539
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 128 place count 592 transition count 509
Applied a total of 128 rules in 75 ms. Remains 592 /657 variables (removed 65) and now considering 509/574 (removed 65) transitions.
// Phase 1: matrix 509 rows 592 cols
[2024-05-25 20:08:16] [INFO ] Computed 139 invariants in 3 ms
[2024-05-25 20:08:16] [INFO ] Implicit Places using invariants in 781 ms returned [134, 174, 589]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 782 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 589/657 places, 509/574 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 588 transition count 508
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 588 transition count 508
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 586 transition count 506
Applied a total of 6 rules in 50 ms. Remains 586 /589 variables (removed 3) and now considering 506/509 (removed 3) transitions.
// Phase 1: matrix 506 rows 586 cols
[2024-05-25 20:08:17] [INFO ] Computed 136 invariants in 3 ms
[2024-05-25 20:08:17] [INFO ] Implicit Places using invariants in 800 ms returned []
[2024-05-25 20:08:17] [INFO ] Invariant cache hit.
[2024-05-25 20:08:18] [INFO ] Implicit Places using invariants and state equation in 922 ms returned []
Implicit Place search using SMT with State Equation took 1726 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 586/657 places, 506/574 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2634 ms. Remains : 586/657 places, 506/574 transitions.
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Parking-PT-832-LTLFireability-14
Product exploration explored 100000 steps with 514 reset in 957 ms.
Product exploration explored 100000 steps with 510 reset in 835 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 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 7 factoid took 191 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 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (203 resets) in 514 ms. (77 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 262 ms. (152 steps per ms) remains 1/1 properties
[2024-05-25 20:08:21] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 83/86 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 97/183 variables, 86/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 93/276 variables, 62/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 31/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/276 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/1092 variables, and 182 constraints, problems are : Problem set: 0 solved, 1 unsolved in 170 ms.
Refiners :[Positive P Invariants (semi-flows): 34/136 constraints, State Equation: 148/586 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 83/86 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 97/183 variables, 86/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 93/276 variables, 62/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 31/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/276 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 276/1092 variables, and 183 constraints, problems are : Problem set: 0 solved, 1 unsolved in 190 ms.
Refiners :[Positive P Invariants (semi-flows): 34/136 constraints, State Equation: 148/586 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 372ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 7 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
Parikh walk visited 1 properties in 11 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 542 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 138 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 586 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 586/586 places, 506/506 transitions.
Applied a total of 0 rules in 24 ms. Remains 586 /586 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2024-05-25 20:08:22] [INFO ] Invariant cache hit.
[2024-05-25 20:08:23] [INFO ] Implicit Places using invariants in 663 ms returned []
[2024-05-25 20:08:23] [INFO ] Invariant cache hit.
[2024-05-25 20:08:24] [INFO ] Implicit Places using invariants and state equation in 1122 ms returned []
Implicit Place search using SMT with State Equation took 1786 ms to find 0 implicit places.
[2024-05-25 20:08:24] [INFO ] Redundant transitions in 4 ms returned []
Running 338 sub problems to find dead transitions.
[2024-05-25 20:08:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/578 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/578 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (OVERLAPS) 8/586 variables, 8/136 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (OVERLAPS) 506/1092 variables, 586/722 constraints. Problems are: Problem set: 0 solved, 338 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 1.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 1.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 0.0)
(s35 1.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 1.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 1.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 1.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 1.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 1.0)
(s82 1.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 1.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 1.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 1.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 1.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 1.0)
(s238 0.0)
(s239 1.0)
(s240 0.0)
(s241 1.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 1.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 1.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 1.0)
(s290 0.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 1.0)
(s295 0.0)
(s296 1.0)
(s297 0.0)
(s298 1.0)
(s299 0.0)
(s300 1.0)
(s301 0.0)
(s302 1.0)
(s303 0.0)
(s304 1.0)
(s305 0.0)
(s306 1.0)
(s307 0.0)
(s308 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1092/1092 variables, and 722 constraints, problems are : Problem set: 0 solved, 338 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 586/586 constraints, PredecessorRefiner: 338/338 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 338 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/578 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/578 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (OVERLAPS) 8/586 variables, 8/136 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (OVERLAPS) 506/1092 variables, 586/722 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1092 variables, 338/1060 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1092 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 338 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1092/1092 variables, and 1060 constraints, problems are : Problem set: 0 solved, 338 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 586/586 constraints, PredecessorRefiner: 338/338 constraints, Known Traps: 0/0 constraints]
After SMT, in 60132ms problems are : Problem set: 0 solved, 338 unsolved
Search for dead transitions found 0 dead transitions in 60141ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61964 ms. Remains : 586/586 places, 506/506 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 p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 7 factoid took 213 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 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (202 resets) in 397 ms. (100 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 1/1 properties
[2024-05-25 20:09:24] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 83/86 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 97/183 variables, 86/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 93/276 variables, 62/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 31/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/276 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/1092 variables, and 182 constraints, problems are : Problem set: 0 solved, 1 unsolved in 112 ms.
Refiners :[Positive P Invariants (semi-flows): 34/136 constraints, State Equation: 148/586 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 83/86 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 97/183 variables, 86/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 93/276 variables, 62/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 31/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/276 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 276/1092 variables, and 183 constraints, problems are : Problem set: 0 solved, 1 unsolved in 125 ms.
Refiners :[Positive P Invariants (semi-flows): 34/136 constraints, State Equation: 148/586 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 245ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 316 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 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 510 reset in 760 ms.
Product exploration explored 100000 steps with 515 reset in 875 ms.
Built C files in :
/tmp/ltsmin2342178497647947168
[2024-05-25 20:09:27] [INFO ] Computing symmetric may disable matrix : 506 transitions.
[2024-05-25 20:09:27] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:09:27] [INFO ] Computing symmetric may enable matrix : 506 transitions.
[2024-05-25 20:09:27] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:09:27] [INFO ] Computing Do-Not-Accords matrix : 506 transitions.
[2024-05-25 20:09:27] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:09:27] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2342178497647947168
Running compilation step : cd /tmp/ltsmin2342178497647947168;'/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 2335 ms.
Running link step : cd /tmp/ltsmin2342178497647947168;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 87 ms.
Running LTSmin : cd /tmp/ltsmin2342178497647947168;'/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/stateBased10445279210764892082.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 586 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 586/586 places, 506/506 transitions.
Applied a total of 0 rules in 18 ms. Remains 586 /586 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2024-05-25 20:09:42] [INFO ] Invariant cache hit.
[2024-05-25 20:09:43] [INFO ] Implicit Places using invariants in 550 ms returned []
[2024-05-25 20:09:43] [INFO ] Invariant cache hit.
[2024-05-25 20:09:44] [INFO ] Implicit Places using invariants and state equation in 1203 ms returned []
Implicit Place search using SMT with State Equation took 1754 ms to find 0 implicit places.
[2024-05-25 20:09:44] [INFO ] Redundant transitions in 4 ms returned []
Running 338 sub problems to find dead transitions.
[2024-05-25 20:09:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/578 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/578 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (OVERLAPS) 8/586 variables, 8/136 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (OVERLAPS) 506/1092 variables, 586/722 constraints. Problems are: Problem set: 0 solved, 338 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1092/1092 variables, and 722 constraints, problems are : Problem set: 0 solved, 338 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 586/586 constraints, PredecessorRefiner: 338/338 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 338 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/578 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/578 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (OVERLAPS) 8/586 variables, 8/136 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (OVERLAPS) 506/1092 variables, 586/722 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1092 variables, 338/1060 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1092 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 338 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1092/1092 variables, and 1060 constraints, problems are : Problem set: 0 solved, 338 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 586/586 constraints, PredecessorRefiner: 338/338 constraints, Known Traps: 0/0 constraints]
After SMT, in 60110ms problems are : Problem set: 0 solved, 338 unsolved
Search for dead transitions found 0 dead transitions in 60117ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61902 ms. Remains : 586/586 places, 506/506 transitions.
Built C files in :
/tmp/ltsmin3222344595592975501
[2024-05-25 20:10:44] [INFO ] Computing symmetric may disable matrix : 506 transitions.
[2024-05-25 20:10:44] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:10:44] [INFO ] Computing symmetric may enable matrix : 506 transitions.
[2024-05-25 20:10:44] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:10:44] [INFO ] Computing Do-Not-Accords matrix : 506 transitions.
[2024-05-25 20:10:44] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:10:44] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3222344595592975501
Running compilation step : cd /tmp/ltsmin3222344595592975501;'/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 2188 ms.
Running link step : cd /tmp/ltsmin3222344595592975501;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin3222344595592975501;'/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/stateBased17885330617617835125.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 20:10:59] [INFO ] Flatten gal took : 17 ms
[2024-05-25 20:10:59] [INFO ] Flatten gal took : 16 ms
[2024-05-25 20:10:59] [INFO ] Time to serialize gal into /tmp/LTL16292604632415421888.gal : 8 ms
[2024-05-25 20:10:59] [INFO ] Time to serialize properties into /tmp/LTL4782513965666521111.prop : 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/LTL16292604632415421888.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11154407739940061915.hoa' '-atoms' '/tmp/LTL4782513965666521111.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...319
Loading property file /tmp/LTL4782513965666521111.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11154407739940061915.hoa
Detected timeout of ITS tools.
[2024-05-25 20:11:14] [INFO ] Flatten gal took : 15 ms
[2024-05-25 20:11:14] [INFO ] Flatten gal took : 15 ms
[2024-05-25 20:11:14] [INFO ] Time to serialize gal into /tmp/LTL5003624292954011002.gal : 3 ms
[2024-05-25 20:11:14] [INFO ] Time to serialize properties into /tmp/LTL1334425873491929000.ltl : 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/LTL5003624292954011002.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1334425873491929000.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...275
Read 1 LTL properties
Checking formula 0 : !((G(F(("((p439==0)||(p471==0))")||(G("(p156!=1)"))))))
Formula 0 simplified : G(F!"(p156!=1)" & FG!"((p439==0)||(p471==0))")
Detected timeout of ITS tools.
[2024-05-25 20:11:29] [INFO ] Flatten gal took : 16 ms
[2024-05-25 20:11:29] [INFO ] Applying decomposition
[2024-05-25 20:11:29] [INFO ] Flatten gal took : 15 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/graph17341268523582383239.txt' '-o' '/tmp/graph17341268523582383239.bin' '-w' '/tmp/graph17341268523582383239.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17341268523582383239.bin' '-l' '-1' '-v' '-w' '/tmp/graph17341268523582383239.weights' '-q' '0' '-e' '0.001'
[2024-05-25 20:11:29] [INFO ] Decomposing Gal with order
[2024-05-25 20:11:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 20:11:29] [INFO ] Removed a total of 112 redundant transitions.
[2024-05-25 20:11:29] [INFO ] Flatten gal took : 39 ms
[2024-05-25 20:11:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 10 ms.
[2024-05-25 20:11:29] [INFO ] Time to serialize gal into /tmp/LTL1879662934950335542.gal : 8 ms
[2024-05-25 20:11:29] [INFO ] Time to serialize properties into /tmp/LTL3564152139449315250.ltl : 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/LTL1879662934950335542.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3564152139449315250.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(F(("((i11.u156.p439==0)||(i11.u170.p471==0))")||(G("(i5.u68.p156!=1)"))))))
Formula 0 simplified : G(F!"(i5.u68.p156!=1)" & FG!"((i11.u156.p439==0)||(i11.u170.p471==0))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 7.8311e+10 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
1417 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,14.3068,449844,1,0,651694,471,4422,3.84343e+06,174,1214,292144
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-832-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Detected timeout of ITS tools.
Treatment of property Parking-PT-832-LTLFireability-14 finished in 208808 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((F(p1)&&p0)))))'
Support contains 3 out of 657 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 657/657 places, 574/574 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 654 transition count 571
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 654 transition count 571
Applied a total of 6 rules in 21 ms. Remains 654 /657 variables (removed 3) and now considering 571/574 (removed 3) transitions.
// Phase 1: matrix 571 rows 654 cols
[2024-05-25 20:11:44] [INFO ] Computed 139 invariants in 2 ms
[2024-05-25 20:11:45] [INFO ] Implicit Places using invariants in 555 ms returned [136, 179]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 557 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 652/657 places, 571/574 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 651 transition count 570
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 651 transition count 570
Applied a total of 2 rules in 20 ms. Remains 651 /652 variables (removed 1) and now considering 570/571 (removed 1) transitions.
// Phase 1: matrix 570 rows 651 cols
[2024-05-25 20:11:45] [INFO ] Computed 137 invariants in 1 ms
[2024-05-25 20:11:46] [INFO ] Implicit Places using invariants in 592 ms returned []
[2024-05-25 20:11:46] [INFO ] Invariant cache hit.
[2024-05-25 20:11:46] [INFO ] State equation strengthened by 152 read => feed constraints.
[2024-05-25 20:11:47] [INFO ] Implicit Places using invariants and state equation in 1629 ms returned []
Implicit Place search using SMT with State Equation took 2224 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 651/657 places, 570/574 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2822 ms. Remains : 651/657 places, 570/574 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-832-LTLFireability-15
Stuttering criterion allowed to conclude after 179 steps with 0 reset in 2 ms.
FORMULA Parking-PT-832-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-15 finished in 3001 ms.
All properties solved by simple procedures.
Total runtime 405449 ms.

BK_STOP 1716667907960

--------------------
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-832"
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-832, 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-171654406900092"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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