Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r150-smll-165276998700332.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
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 r150-smll-165276998700332
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 7.3K Apr 30 06:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 30 06:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 30 06:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 30 06:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 9 08:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 251K May 10 09:34 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 1653061970146

Running Version 202205111006
[2022-05-20 15:52:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 15:52:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 15:52:52] [INFO ] Load time of PNML (sax parser for PT used): 294 ms
[2022-05-20 15:52:52] [INFO ] Transformed 737 places.
[2022-05-20 15:52:52] [INFO ] Transformed 993 transitions.
[2022-05-20 15:52:52] [INFO ] Found NUPN structural information;
[2022-05-20 15:52:52] [INFO ] Parsed PT model containing 737 places and 993 transitions in 531 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 384 transitions
Reduce redundant transitions removed 384 transitions.
FORMULA Parking-PT-832-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-832-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-832-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-832-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-832-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 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 157 ms. Remains 730 /737 variables (removed 7) and now considering 602/609 (removed 7) transitions.
// Phase 1: matrix 602 rows 730 cols
[2022-05-20 15:52:53] [INFO ] Computed 184 place invariants in 41 ms
[2022-05-20 15:52:54] [INFO ] Implicit Places using invariants in 1288 ms returned [136, 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, 647, 649, 676, 684, 692, 700, 724, 726]
Discarding 46 places :
Implicit Place search using SMT only with invariants took 1335 ms to find 46 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 684/737 places, 602/609 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 654 transition count 572
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 654 transition count 572
Applied a total of 60 rules in 104 ms. Remains 654 /684 variables (removed 30) and now considering 572/602 (removed 30) transitions.
// Phase 1: matrix 572 rows 654 cols
[2022-05-20 15:52:54] [INFO ] Computed 138 place invariants in 23 ms
[2022-05-20 15:52:55] [INFO ] Implicit Places using invariants in 1009 ms returned []
// Phase 1: matrix 572 rows 654 cols
[2022-05-20 15:52:55] [INFO ] Computed 138 place invariants in 8 ms
[2022-05-20 15:52:56] [INFO ] State equation strengthened by 152 read => feed constraints.
[2022-05-20 15:52:57] [INFO ] Implicit Places using invariants and state equation in 1636 ms returned []
Implicit Place search using SMT with State Equation took 2665 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 654/737 places, 572/609 transitions.
Finished structural reductions, in 2 iterations. Remains : 654/737 places, 572/609 transitions.
Support contains 30 out of 654 places after structural reductions.
[2022-05-20 15:52:57] [INFO ] Flatten gal took : 190 ms
[2022-05-20 15:52:57] [INFO ] Flatten gal took : 94 ms
[2022-05-20 15:52:57] [INFO ] Input system was already deterministic with 572 transitions.
Support contains 29 out of 654 places (down from 30) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 51 resets, run finished after 991 ms. (steps per millisecond=10 ) properties (out of 22) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 572 rows 654 cols
[2022-05-20 15:52:59] [INFO ] Computed 138 place invariants in 5 ms
[2022-05-20 15:53:00] [INFO ] [Real]Absence check using 138 positive place invariants in 60 ms returned sat
[2022-05-20 15:53:01] [INFO ] After 1042ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:9
[2022-05-20 15:53:01] [INFO ] State equation strengthened by 152 read => feed constraints.
[2022-05-20 15:53:01] [INFO ] After 224ms SMT Verify possible using 152 Read/Feed constraints in real domain returned unsat :0 sat :0 real:10
[2022-05-20 15:53:01] [INFO ] After 2079ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-05-20 15:53:02] [INFO ] [Nat]Absence check using 138 positive place invariants in 68 ms returned sat
[2022-05-20 15:53:03] [INFO ] After 1011ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2022-05-20 15:53:03] [INFO ] After 596ms SMT Verify possible using 152 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2022-05-20 15:53:04] [INFO ] After 1375ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 398 ms.
[2022-05-20 15:53:05] [INFO ] After 3526ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 8 different solutions.
Parikh walk visited 2 properties in 297 ms.
Support contains 10 out of 654 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 654/654 places, 572/572 transitions.
Drop transitions 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 654 transition count 556
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 638 transition count 556
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 638 transition count 540
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 622 transition count 540
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 621 transition count 539
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 621 transition count 539
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 2 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 130 place count 589 transition count 507
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 132 place count 588 transition count 526
Free-agglomeration rule applied 153 times.
Iterating global reduction 2 with 153 rules applied. Total rules applied 285 place count 588 transition count 373
Reduce places removed 153 places and 0 transitions.
Graph (complete) has 878 edges and 435 vertex of which 294 are kept as prefixes of interest. Removing 141 places using SCC suffix rule.7 ms
Discarding 141 places :
Also discarding 96 output transitions
Drop transitions removed 96 transitions
Iterating post reduction 2 with 154 rules applied. Total rules applied 439 place count 294 transition count 277
Drop transitions removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 469 place count 294 transition count 247
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 470 place count 294 transition count 246
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 471 place count 293 transition count 246
Applied a total of 471 rules in 391 ms. Remains 293 /654 variables (removed 361) and now considering 246/572 (removed 326) transitions.
Finished structural reductions, in 1 iterations. Remains : 293/654 places, 246/572 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 8) seen :7
Finished Best-First random walk after 557 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=185 )
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(X((F(p0)&&X(p1)))))))'
Support contains 2 out of 654 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 654/654 places, 572/572 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions 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 653 transition count 555
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 637 transition count 555
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 637 transition count 539
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 621 transition count 539
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 620 transition count 538
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 620 transition count 538
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 128 place count 589 transition count 507
Applied a total of 128 rules in 153 ms. Remains 589 /654 variables (removed 65) and now considering 507/572 (removed 65) transitions.
// Phase 1: matrix 507 rows 589 cols
[2022-05-20 15:53:06] [INFO ] Computed 138 place invariants in 5 ms
[2022-05-20 15:53:07] [INFO ] Implicit Places using invariants in 627 ms returned [170, 504]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 637 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 587/654 places, 507/572 transitions.
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 2 place count 586 transition count 506
Applied a total of 2 rules in 71 ms. Remains 586 /587 variables (removed 1) and now considering 506/507 (removed 1) transitions.
// Phase 1: matrix 506 rows 586 cols
[2022-05-20 15:53:07] [INFO ] Computed 136 place invariants in 3 ms
[2022-05-20 15:53:07] [INFO ] Implicit Places using invariants in 583 ms returned []
// Phase 1: matrix 506 rows 586 cols
[2022-05-20 15:53:07] [INFO ] Computed 136 place invariants in 8 ms
[2022-05-20 15:53:09] [INFO ] Implicit Places using invariants and state equation in 1110 ms returned []
Implicit Place search using SMT with State Equation took 1706 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 586/654 places, 506/572 transitions.
Finished structural reductions, in 2 iterations. Remains : 586/654 places, 506/572 transitions.
Stuttering acceptance computed with spot in 446 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Parking-PT-832-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s307 1), p0:(EQ s465 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 187 steps with 0 reset in 14 ms.
FORMULA Parking-PT-832-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-01 finished in 3137 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(F((p0&&F(p1))))))))'
Support contains 3 out of 654 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 654/654 places, 572/572 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions 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 653 transition count 556
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 638 transition count 556
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 638 transition count 541
Deduced a syphon composed of 15 places in 7 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 60 place count 623 transition count 541
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 62 place count 621 transition count 539
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 621 transition count 539
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 2 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 128 place count 589 transition count 507
Applied a total of 128 rules in 193 ms. Remains 589 /654 variables (removed 65) and now considering 507/572 (removed 65) transitions.
// Phase 1: matrix 507 rows 589 cols
[2022-05-20 15:53:09] [INFO ] Computed 138 place invariants in 3 ms
[2022-05-20 15:53:10] [INFO ] Implicit Places using invariants in 615 ms returned [170, 504]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 639 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 587/654 places, 507/572 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 586 transition count 506
Applied a total of 2 rules in 96 ms. Remains 586 /587 variables (removed 1) and now considering 506/507 (removed 1) transitions.
// Phase 1: matrix 506 rows 586 cols
[2022-05-20 15:53:10] [INFO ] Computed 136 place invariants in 2 ms
[2022-05-20 15:53:11] [INFO ] Implicit Places using invariants in 719 ms returned []
// Phase 1: matrix 506 rows 586 cols
[2022-05-20 15:53:11] [INFO ] Computed 136 place invariants in 2 ms
[2022-05-20 15:53:12] [INFO ] Implicit Places using invariants and state equation in 857 ms returned []
Implicit Place search using SMT with State Equation took 1579 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 586/654 places, 506/572 transitions.
Finished structural reductions, in 2 iterations. Remains : 586/654 places, 506/572 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Parking-PT-832-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s10 1) (EQ s513 1)), p0:(EQ s262 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 196 steps with 0 reset in 5 ms.
FORMULA Parking-PT-832-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-04 finished in 2688 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (G(p1)||p2)))'
Support contains 5 out of 654 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 654/654 places, 572/572 transitions.
Drop transitions 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 654 transition count 556
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 638 transition count 556
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 638 transition count 540
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 622 transition count 540
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 621 transition count 539
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 621 transition count 539
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 2 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 130 place count 589 transition count 507
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 132 place count 588 transition count 526
Applied a total of 132 rules in 175 ms. Remains 588 /654 variables (removed 66) and now considering 526/572 (removed 46) transitions.
// Phase 1: matrix 526 rows 588 cols
[2022-05-20 15:53:12] [INFO ] Computed 138 place invariants in 4 ms
[2022-05-20 15:53:13] [INFO ] Implicit Places using invariants in 715 ms returned [503]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 718 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 587/654 places, 526/572 transitions.
Applied a total of 0 rules in 47 ms. Remains 587 /587 variables (removed 0) and now considering 526/526 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 587/654 places, 526/572 transitions.
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-832-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s68 1) (EQ s390 1)), p1:(NEQ s40 1), p0:(AND (EQ s140 1) (EQ s172 1) (EQ s68 1) (EQ s390 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 207 steps with 0 reset in 5 ms.
FORMULA Parking-PT-832-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-05 finished in 1106 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(p0))))'
Support contains 2 out of 654 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 654/654 places, 572/572 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 652 transition count 570
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 652 transition count 570
Applied a total of 4 rules in 59 ms. Remains 652 /654 variables (removed 2) and now considering 570/572 (removed 2) transitions.
// Phase 1: matrix 570 rows 652 cols
[2022-05-20 15:53:13] [INFO ] Computed 138 place invariants in 6 ms
[2022-05-20 15:53:14] [INFO ] Implicit Places using invariants in 713 ms returned [177]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 716 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 651/654 places, 570/572 transitions.
Applied a total of 0 rules in 26 ms. Remains 651 /651 variables (removed 0) and now considering 570/570 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 651/654 places, 570/572 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-832-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s557 1) (EQ s580 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 457 steps with 83 reset in 30 ms.
FORMULA Parking-PT-832-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-06 finished in 960 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X((G(p0) U !p0))&&(F(G(X(p1)))||p2))))'
Support contains 4 out of 654 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 654/654 places, 572/572 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 652 transition count 570
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 652 transition count 570
Applied a total of 4 rules in 39 ms. Remains 652 /654 variables (removed 2) and now considering 570/572 (removed 2) transitions.
// Phase 1: matrix 570 rows 652 cols
[2022-05-20 15:53:14] [INFO ] Computed 138 place invariants in 3 ms
[2022-05-20 15:53:15] [INFO ] Implicit Places using invariants in 679 ms returned [177, 558]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 682 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 650/654 places, 570/572 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 52 ms. Remains 649 /650 variables (removed 1) and now considering 569/570 (removed 1) transitions.
// Phase 1: matrix 569 rows 649 cols
[2022-05-20 15:53:15] [INFO ] Computed 136 place invariants in 6 ms
[2022-05-20 15:53:15] [INFO ] Implicit Places using invariants in 699 ms returned []
// Phase 1: matrix 569 rows 649 cols
[2022-05-20 15:53:15] [INFO ] Computed 136 place invariants in 5 ms
[2022-05-20 15:53:16] [INFO ] State equation strengthened by 152 read => feed constraints.
[2022-05-20 15:53:17] [INFO ] Implicit Places using invariants and state equation in 1893 ms returned []
Implicit Place search using SMT with State Equation took 2596 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 649/654 places, 569/572 transitions.
Finished structural reductions, in 2 iterations. Remains : 649/654 places, 569/572 transitions.
Stuttering acceptance computed with spot in 324 ms :[(OR p0 (AND (NOT p1) (NOT p2))), p0, (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (AND (NOT p2) (NOT p1) (NOT p0)), (AND p0 (NOT p1)), false]
Running random walk in product with property : Parking-PT-832-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p2 p1), acceptance={1} source=2 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={0, 1} source=2 dest: 4}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={1} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(AND p2 p1 (NOT p0)), acceptance={1} source=3 dest: 4}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 4}, { cond=(AND p2 p1 p0), acceptance={} source=3 dest: 5}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=3 dest: 5}], [{ cond=(AND (NOT p2) p1 p0), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=4 dest: 3}, { cond=(AND p1 p0), acceptance={1} source=4 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=4 dest: 4}], [{ cond=(AND (NOT p2) p1 p0), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=5 dest: 3}, { cond=(AND p2 p1 p0), acceptance={} source=5 dest: 5}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(EQ s14 1), p0:(AND (EQ s382 1) (EQ s398 1)), p1:(EQ s145 0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 40033 reset in 3504 ms.
Product exploration explored 100000 steps with 40092 reset in 2581 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 p2) (NOT p0) p1), (X (NOT (AND p2 (NOT p1)))), (X (AND p2 p1)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : [(X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (AND p2 p1 (NOT p0)))), (X (X (NOT (AND p2 p1 (NOT p0)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p2) (NOT p0) p1)
Knowledge based reduction with 19 factoid took 1278 ms. Reduced automaton from 6 states, 24 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA Parking-PT-832-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-832-LTLFireability-07 finished in 11122 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 654 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 654/654 places, 572/572 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions 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 653 transition count 556
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 638 transition count 556
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 638 transition count 541
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 623 transition count 541
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 62 place count 621 transition count 539
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 621 transition count 539
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 128 place count 589 transition count 507
Applied a total of 128 rules in 89 ms. Remains 589 /654 variables (removed 65) and now considering 507/572 (removed 65) transitions.
// Phase 1: matrix 507 rows 589 cols
[2022-05-20 15:53:25] [INFO ] Computed 138 place invariants in 2 ms
[2022-05-20 15:53:26] [INFO ] Implicit Places using invariants in 670 ms returned [170, 502]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 676 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 587/654 places, 507/572 transitions.
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 2 place count 586 transition count 506
Applied a total of 2 rules in 72 ms. Remains 586 /587 variables (removed 1) and now considering 506/507 (removed 1) transitions.
// Phase 1: matrix 506 rows 586 cols
[2022-05-20 15:53:26] [INFO ] Computed 136 place invariants in 3 ms
[2022-05-20 15:53:27] [INFO ] Implicit Places using invariants in 789 ms returned []
// Phase 1: matrix 506 rows 586 cols
[2022-05-20 15:53:27] [INFO ] Computed 136 place invariants in 3 ms
[2022-05-20 15:53:28] [INFO ] Implicit Places using invariants and state equation in 973 ms returned []
Implicit Place search using SMT with State Equation took 1765 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 586/654 places, 506/572 transitions.
Finished structural reductions, in 2 iterations. Remains : 586/654 places, 506/572 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-832-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s557 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 513 reset in 772 ms.
Product exploration explored 100000 steps with 516 reset in 869 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Finished random walk after 3099 steps, including 15 resets, run visited all 1 properties in 46 ms. (steps per millisecond=67 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 184 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Support contains 1 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 31 ms. Remains 586 /586 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 586 cols
[2022-05-20 15:53:30] [INFO ] Computed 136 place invariants in 3 ms
[2022-05-20 15:53:31] [INFO ] Implicit Places using invariants in 636 ms returned []
// Phase 1: matrix 506 rows 586 cols
[2022-05-20 15:53:31] [INFO ] Computed 136 place invariants in 3 ms
[2022-05-20 15:53:32] [INFO ] Implicit Places using invariants and state equation in 873 ms returned []
Implicit Place search using SMT with State Equation took 1513 ms to find 0 implicit places.
[2022-05-20 15:53:32] [INFO ] Redundant transitions in 56 ms returned []
// Phase 1: matrix 506 rows 586 cols
[2022-05-20 15:53:32] [INFO ] Computed 136 place invariants in 2 ms
[2022-05-20 15:53:32] [INFO ] Dead Transitions using invariants and state equation in 612 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 50 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 355349 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :{}
Probabilistic random walk after 355349 steps, saw 74915 distinct states, run finished after 3002 ms. (steps per millisecond=118 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 506 rows 586 cols
[2022-05-20 15:53:36] [INFO ] Computed 136 place invariants in 2 ms
[2022-05-20 15:53:36] [INFO ] [Real]Absence check using 136 positive place invariants in 41 ms returned sat
[2022-05-20 15:53:36] [INFO ] After 293ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-20 15:53:36] [INFO ] After 339ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2022-05-20 15:53:36] [INFO ] After 548ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 67 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=33 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 221 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 518 reset in 798 ms.
Product exploration explored 100000 steps with 515 reset in 867 ms.
Built C files in :
/tmp/ltsmin4768991610665464280
[2022-05-20 15:53:39] [INFO ] Computing symmetric may disable matrix : 506 transitions.
[2022-05-20 15:53:39] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 15:53:39] [INFO ] Computing symmetric may enable matrix : 506 transitions.
[2022-05-20 15:53:39] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 15:53:39] [INFO ] Computing Do-Not-Accords matrix : 506 transitions.
[2022-05-20 15:53:39] [INFO ] Computation of Completed DNA matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 15:53:39] [INFO ] Built C files in 124ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4768991610665464280
Running compilation step : cd /tmp/ltsmin4768991610665464280;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1930 ms.
Running link step : cd /tmp/ltsmin4768991610665464280;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin4768991610665464280;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18100558025556819734.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 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.
// Phase 1: matrix 506 rows 586 cols
[2022-05-20 15:53:54] [INFO ] Computed 136 place invariants in 2 ms
[2022-05-20 15:53:54] [INFO ] Implicit Places using invariants in 493 ms returned []
// Phase 1: matrix 506 rows 586 cols
[2022-05-20 15:53:54] [INFO ] Computed 136 place invariants in 6 ms
[2022-05-20 15:53:55] [INFO ] Implicit Places using invariants and state equation in 848 ms returned []
Implicit Place search using SMT with State Equation took 1343 ms to find 0 implicit places.
[2022-05-20 15:53:55] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 506 rows 586 cols
[2022-05-20 15:53:55] [INFO ] Computed 136 place invariants in 5 ms
[2022-05-20 15:53:55] [INFO ] Dead Transitions using invariants and state equation in 518 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 586/586 places, 506/506 transitions.
Built C files in :
/tmp/ltsmin10807950985034429289
[2022-05-20 15:53:56] [INFO ] Computing symmetric may disable matrix : 506 transitions.
[2022-05-20 15:53:56] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 15:53:56] [INFO ] Computing symmetric may enable matrix : 506 transitions.
[2022-05-20 15:53:56] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 15:53:56] [INFO ] Computing Do-Not-Accords matrix : 506 transitions.
[2022-05-20 15:53:56] [INFO ] Computation of Completed DNA matrix. took 25 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 15:53:56] [INFO ] Built C files in 79ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10807950985034429289
Running compilation step : cd /tmp/ltsmin10807950985034429289;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1702 ms.
Running link step : cd /tmp/ltsmin10807950985034429289;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin10807950985034429289;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6612949811448422623.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 15:54:11] [INFO ] Flatten gal took : 70 ms
[2022-05-20 15:54:11] [INFO ] Flatten gal took : 57 ms
[2022-05-20 15:54:11] [INFO ] Time to serialize gal into /tmp/LTL8334146024430835033.gal : 31 ms
[2022-05-20 15:54:11] [INFO ] Time to serialize properties into /tmp/LTL12610343142210389875.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8334146024430835033.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12610343142210389875.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8334146...267
Read 1 LTL properties
Checking formula 0 : !((G(F("(p702!=1)"))))
Formula 0 simplified : !GF"(p702!=1)"
Detected timeout of ITS tools.
[2022-05-20 15:54:26] [INFO ] Flatten gal took : 35 ms
[2022-05-20 15:54:26] [INFO ] Applying decomposition
[2022-05-20 15:54:26] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13093301149675248735.txt' '-o' '/tmp/graph13093301149675248735.bin' '-w' '/tmp/graph13093301149675248735.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13093301149675248735.bin' '-l' '-1' '-v' '-w' '/tmp/graph13093301149675248735.weights' '-q' '0' '-e' '0.001'
[2022-05-20 15:54:26] [INFO ] Decomposing Gal with order
[2022-05-20 15:54:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 15:54:26] [INFO ] Removed a total of 112 redundant transitions.
[2022-05-20 15:54:27] [INFO ] Flatten gal took : 135 ms
[2022-05-20 15:54:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 21 ms.
[2022-05-20 15:54:27] [INFO ] Time to serialize gal into /tmp/LTL10023788840965060690.gal : 15 ms
[2022-05-20 15:54:27] [INFO ] Time to serialize properties into /tmp/LTL16726348342083531288.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10023788840965060690.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16726348342083531288.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1002378...247
Read 1 LTL properties
Checking formula 0 : !((G(F("(i14.u229.p702!=1)"))))
Formula 0 simplified : !GF"(i14.u229.p702!=1)"
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
472 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,4.81189,128060,1,0,156677,460,4417,900140,175,1084,146471
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-832-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property Parking-PT-832-LTLFireability-08 finished in 67204 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 654 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 654/654 places, 572/572 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 652 transition count 570
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 652 transition count 570
Applied a total of 4 rules in 35 ms. Remains 652 /654 variables (removed 2) and now considering 570/572 (removed 2) transitions.
// Phase 1: matrix 570 rows 652 cols
[2022-05-20 15:54:32] [INFO ] Computed 138 place invariants in 1 ms
[2022-05-20 15:54:33] [INFO ] Implicit Places using invariants in 515 ms returned [177, 558]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 516 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 650/654 places, 570/572 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 38 ms. Remains 649 /650 variables (removed 1) and now considering 569/570 (removed 1) transitions.
// Phase 1: matrix 569 rows 649 cols
[2022-05-20 15:54:33] [INFO ] Computed 136 place invariants in 2 ms
[2022-05-20 15:54:33] [INFO ] Implicit Places using invariants in 385 ms returned []
// Phase 1: matrix 569 rows 649 cols
[2022-05-20 15:54:33] [INFO ] Computed 136 place invariants in 3 ms
[2022-05-20 15:54:34] [INFO ] State equation strengthened by 152 read => feed constraints.
[2022-05-20 15:54:35] [INFO ] Implicit Places using invariants and state equation in 1484 ms returned []
Implicit Place search using SMT with State Equation took 1884 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 649/654 places, 569/572 transitions.
Finished structural reductions, in 2 iterations. Remains : 649/654 places, 569/572 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-832-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s20 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 2939 ms.
Product exploration explored 100000 steps with 50000 reset in 2602 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 : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Parking-PT-832-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-832-LTLFireability-10 finished in 8209 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!G(p0) U G(!p0)))'
Support contains 2 out of 654 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 654/654 places, 572/572 transitions.
Drop transitions 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 654 transition count 556
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 638 transition count 556
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 638 transition count 540
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 622 transition count 540
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 620 transition count 538
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 620 transition count 538
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 132 place count 588 transition count 506
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 134 place count 587 transition count 509
Applied a total of 134 rules in 100 ms. Remains 587 /654 variables (removed 67) and now considering 509/572 (removed 63) transitions.
// Phase 1: matrix 509 rows 587 cols
[2022-05-20 15:54:40] [INFO ] Computed 138 place invariants in 1 ms
[2022-05-20 15:54:41] [INFO ] Implicit Places using invariants in 529 ms returned [170, 502]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 531 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 585/654 places, 509/572 transitions.
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 2 place count 584 transition count 524
Applied a total of 2 rules in 36 ms. Remains 584 /585 variables (removed 1) and now considering 524/509 (removed -15) transitions.
// Phase 1: matrix 524 rows 584 cols
[2022-05-20 15:54:41] [INFO ] Computed 136 place invariants in 2 ms
[2022-05-20 15:54:42] [INFO ] Implicit Places using invariants in 541 ms returned []
// Phase 1: matrix 524 rows 584 cols
[2022-05-20 15:54:42] [INFO ] Computed 136 place invariants in 2 ms
[2022-05-20 15:54:42] [INFO ] State equation strengthened by 220 read => feed constraints.
[2022-05-20 15:54:43] [INFO ] Implicit Places using invariants and state equation in 1478 ms returned []
Implicit Place search using SMT with State Equation took 2043 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 584/654 places, 524/572 transitions.
Finished structural reductions, in 2 iterations. Remains : 584/654 places, 524/572 transitions.
Stuttering acceptance computed with spot in 37 ms :[p0]
Running random walk in product with property : Parking-PT-832-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s66 1) (EQ s386 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 512 reset in 918 ms.
Product exploration explored 100000 steps with 514 reset in 926 ms.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 36 ms :[p0]
Incomplete random walk after 10000 steps, including 51 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 391912 steps, run timeout after 3001 ms. (steps per millisecond=130 ) properties seen :{}
Probabilistic random walk after 391912 steps, saw 79214 distinct states, run finished after 3001 ms. (steps per millisecond=130 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 524 rows 584 cols
[2022-05-20 15:54:48] [INFO ] Computed 136 place invariants in 1 ms
[2022-05-20 15:54:48] [INFO ] [Real]Absence check using 136 positive place invariants in 80 ms returned sat
[2022-05-20 15:54:49] [INFO ] After 610ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 15:54:49] [INFO ] [Nat]Absence check using 136 positive place invariants in 38 ms returned sat
[2022-05-20 15:54:49] [INFO ] After 364ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 15:54:49] [INFO ] State equation strengthened by 220 read => feed constraints.
[2022-05-20 15:54:50] [INFO ] After 218ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 15:54:50] [INFO ] After 280ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 65 ms.
[2022-05-20 15:54:50] [INFO ] After 898ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 584 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 584/584 places, 524/524 transitions.
Free-agglomeration rule applied 162 times.
Iterating global reduction 0 with 162 rules applied. Total rules applied 162 place count 584 transition count 362
Reduce places removed 162 places and 0 transitions.
Graph (complete) has 855 edges and 422 vertex of which 118 are kept as prefixes of interest. Removing 304 places using SCC suffix rule.0 ms
Discarding 304 places :
Also discarding 248 output transitions
Drop transitions removed 248 transitions
Iterating post reduction 0 with 163 rules applied. Total rules applied 325 place count 118 transition count 114
Drop transitions removed 24 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 353 place count 118 transition count 86
Applied a total of 353 rules in 110 ms. Remains 118 /584 variables (removed 466) and now considering 86/524 (removed 438) transitions.
Finished structural reductions, in 1 iterations. Remains : 118/584 places, 86/524 transitions.
Finished random walk after 66 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=33 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 234 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 61 ms :[p0]
Stuttering acceptance computed with spot in 57 ms :[p0]
Support contains 2 out of 584 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 584/584 places, 524/524 transitions.
Applied a total of 0 rules in 22 ms. Remains 584 /584 variables (removed 0) and now considering 524/524 (removed 0) transitions.
// Phase 1: matrix 524 rows 584 cols
[2022-05-20 15:54:50] [INFO ] Computed 136 place invariants in 2 ms
[2022-05-20 15:54:51] [INFO ] Implicit Places using invariants in 448 ms returned []
// Phase 1: matrix 524 rows 584 cols
[2022-05-20 15:54:51] [INFO ] Computed 136 place invariants in 2 ms
[2022-05-20 15:54:51] [INFO ] State equation strengthened by 220 read => feed constraints.
[2022-05-20 15:54:52] [INFO ] Implicit Places using invariants and state equation in 1478 ms returned []
Implicit Place search using SMT with State Equation took 1943 ms to find 0 implicit places.
[2022-05-20 15:54:52] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 524 rows 584 cols
[2022-05-20 15:54:52] [INFO ] Computed 136 place invariants in 2 ms
[2022-05-20 15:54:53] [INFO ] Dead Transitions using invariants and state equation in 540 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 584/584 places, 524/524 transitions.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 162 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[p0]
Incomplete random walk after 10000 steps, including 52 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 372047 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :{}
Probabilistic random walk after 372047 steps, saw 76744 distinct states, run finished after 3005 ms. (steps per millisecond=123 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 524 rows 584 cols
[2022-05-20 15:54:56] [INFO ] Computed 136 place invariants in 2 ms
[2022-05-20 15:54:56] [INFO ] [Real]Absence check using 136 positive place invariants in 36 ms returned sat
[2022-05-20 15:54:57] [INFO ] After 478ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 15:54:57] [INFO ] [Nat]Absence check using 136 positive place invariants in 36 ms returned sat
[2022-05-20 15:54:57] [INFO ] After 328ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 15:54:57] [INFO ] State equation strengthened by 220 read => feed constraints.
[2022-05-20 15:54:57] [INFO ] After 207ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 15:54:57] [INFO ] After 261ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2022-05-20 15:54:57] [INFO ] After 825ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 27 ms.
Support contains 2 out of 584 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 584/584 places, 524/524 transitions.
Free-agglomeration rule applied 162 times.
Iterating global reduction 0 with 162 rules applied. Total rules applied 162 place count 584 transition count 362
Reduce places removed 162 places and 0 transitions.
Graph (complete) has 855 edges and 422 vertex of which 118 are kept as prefixes of interest. Removing 304 places using SCC suffix rule.0 ms
Discarding 304 places :
Also discarding 248 output transitions
Drop transitions removed 248 transitions
Iterating post reduction 0 with 163 rules applied. Total rules applied 325 place count 118 transition count 114
Drop transitions removed 24 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 353 place count 118 transition count 86
Applied a total of 353 rules in 35 ms. Remains 118 /584 variables (removed 466) and now considering 86/524 (removed 438) transitions.
Finished structural reductions, in 1 iterations. Remains : 118/584 places, 86/524 transitions.
Finished random walk after 101 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=50 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 186 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 44 ms :[p0]
Stuttering acceptance computed with spot in 37 ms :[p0]
Stuttering acceptance computed with spot in 34 ms :[p0]
Product exploration explored 100000 steps with 515 reset in 839 ms.
Product exploration explored 100000 steps with 513 reset in 959 ms.
Built C files in :
/tmp/ltsmin8211821764472560972
[2022-05-20 15:55:00] [INFO ] Computing symmetric may disable matrix : 524 transitions.
[2022-05-20 15:55:00] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 15:55:00] [INFO ] Computing symmetric may enable matrix : 524 transitions.
[2022-05-20 15:55:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 15:55:00] [INFO ] Computing Do-Not-Accords matrix : 524 transitions.
[2022-05-20 15:55:00] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 15:55:00] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8211821764472560972
Running compilation step : cd /tmp/ltsmin8211821764472560972;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1916 ms.
Running link step : cd /tmp/ltsmin8211821764472560972;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin8211821764472560972;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12087419357783429344.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 584 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 584/584 places, 524/524 transitions.
Applied a total of 0 rules in 23 ms. Remains 584 /584 variables (removed 0) and now considering 524/524 (removed 0) transitions.
// Phase 1: matrix 524 rows 584 cols
[2022-05-20 15:55:15] [INFO ] Computed 136 place invariants in 3 ms
[2022-05-20 15:55:15] [INFO ] Implicit Places using invariants in 458 ms returned []
// Phase 1: matrix 524 rows 584 cols
[2022-05-20 15:55:15] [INFO ] Computed 136 place invariants in 8 ms
[2022-05-20 15:55:16] [INFO ] State equation strengthened by 220 read => feed constraints.
[2022-05-20 15:55:17] [INFO ] Implicit Places using invariants and state equation in 1462 ms returned []
Implicit Place search using SMT with State Equation took 1924 ms to find 0 implicit places.
[2022-05-20 15:55:17] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 524 rows 584 cols
[2022-05-20 15:55:17] [INFO ] Computed 136 place invariants in 2 ms
[2022-05-20 15:55:17] [INFO ] Dead Transitions using invariants and state equation in 425 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 584/584 places, 524/524 transitions.
Built C files in :
/tmp/ltsmin3274684891109574954
[2022-05-20 15:55:17] [INFO ] Computing symmetric may disable matrix : 524 transitions.
[2022-05-20 15:55:17] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 15:55:17] [INFO ] Computing symmetric may enable matrix : 524 transitions.
[2022-05-20 15:55:17] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 15:55:17] [INFO ] Computing Do-Not-Accords matrix : 524 transitions.
[2022-05-20 15:55:17] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 15:55:17] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3274684891109574954
Running compilation step : cd /tmp/ltsmin3274684891109574954;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1771 ms.
Running link step : cd /tmp/ltsmin3274684891109574954;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin3274684891109574954;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7096863816714941287.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 15:55:32] [INFO ] Flatten gal took : 89 ms
[2022-05-20 15:55:32] [INFO ] Flatten gal took : 56 ms
[2022-05-20 15:55:32] [INFO ] Time to serialize gal into /tmp/LTL13436326857540853311.gal : 6 ms
[2022-05-20 15:55:32] [INFO ] Time to serialize properties into /tmp/LTL2966330643719018942.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13436326857540853311.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2966330643719018942.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1343632...267
Read 1 LTL properties
Checking formula 0 : !(((!(G("((p66==1)&&(p478==1))")))U(G(!("((p66==1)&&(p478==1))")))))
Formula 0 simplified : !(!G"((p66==1)&&(p478==1))" U G!"((p66==1)&&(p478==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.
[2022-05-20 15:55:47] [INFO ] Flatten gal took : 38 ms
[2022-05-20 15:55:47] [INFO ] Applying decomposition
[2022-05-20 15:55:48] [INFO ] Flatten gal took : 63 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph18439419451084432970.txt' '-o' '/tmp/graph18439419451084432970.bin' '-w' '/tmp/graph18439419451084432970.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18439419451084432970.bin' '-l' '-1' '-v' '-w' '/tmp/graph18439419451084432970.weights' '-q' '0' '-e' '0.001'
[2022-05-20 15:55:48] [INFO ] Decomposing Gal with order
[2022-05-20 15:55:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 15:55:48] [INFO ] Removed a total of 708 redundant transitions.
[2022-05-20 15:55:48] [INFO ] Flatten gal took : 104 ms
[2022-05-20 15:55:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 59 ms.
[2022-05-20 15:55:48] [INFO ] Time to serialize gal into /tmp/LTL7305570571803913828.gal : 10 ms
[2022-05-20 15:55:48] [INFO ] Time to serialize properties into /tmp/LTL7988887745433539254.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7305570571803913828.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7988887745433539254.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7305570...245
Read 1 LTL properties
Checking formula 0 : !(((!(G("((i12.i1.i2.u32.p66==1)&&(i0.i0.i2.u161.p478==1))")))U(G(!("((i12.i1.i2.u32.p66==1)&&(i0.i0.i2.u161.p478==1))")))))
Formula 0 simplified : !(!G"((i12.i1.i2.u32.p66==1)&&(i0.i0.i2.u161.p478==1))" U G!"((i12.i1.i2.u32.p66==1)&&(i0.i0.i2.u161.p478==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.
Built C files in :
/tmp/ltsmin13027800728814813747
[2022-05-20 15:56:03] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13027800728814813747
Running compilation step : cd /tmp/ltsmin13027800728814813747;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1361 ms.
Running link step : cd /tmp/ltsmin13027800728814813747;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin13027800728814813747;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '() U [](!(LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Parking-PT-832-LTLFireability-12 finished in 97748 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((G(G(p1))&&p0))||(F(p2)&&F(p3)))))'
Support contains 4 out of 654 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 654/654 places, 572/572 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 652 transition count 570
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 652 transition count 570
Applied a total of 4 rules in 33 ms. Remains 652 /654 variables (removed 2) and now considering 570/572 (removed 2) transitions.
// Phase 1: matrix 570 rows 652 cols
[2022-05-20 15:56:18] [INFO ] Computed 138 place invariants in 2 ms
[2022-05-20 15:56:19] [INFO ] Implicit Places using invariants in 516 ms returned [177, 558]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 543 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 650/654 places, 570/572 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 45 ms. Remains 649 /650 variables (removed 1) and now considering 569/570 (removed 1) transitions.
// Phase 1: matrix 569 rows 649 cols
[2022-05-20 15:56:19] [INFO ] Computed 136 place invariants in 5 ms
[2022-05-20 15:56:19] [INFO ] Implicit Places using invariants in 422 ms returned []
// Phase 1: matrix 569 rows 649 cols
[2022-05-20 15:56:19] [INFO ] Computed 136 place invariants in 2 ms
[2022-05-20 15:56:20] [INFO ] State equation strengthened by 152 read => feed constraints.
[2022-05-20 15:56:20] [INFO ] Implicit Places using invariants and state equation in 1279 ms returned []
Implicit Place search using SMT with State Equation took 1714 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 649/654 places, 569/572 transitions.
Finished structural reductions, in 2 iterations. Remains : 649/654 places, 569/572 transitions.
Stuttering acceptance computed with spot in 331 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p3), (AND (NOT p3) (NOT p1))]
Running random walk in product with property : Parking-PT-832-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(NOT p3), acceptance={} source=1 dest: 3}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=2 dest: 5}], [{ cond=(OR (AND (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p1))), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p3) p0 p1), acceptance={} source=3 dest: 7}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 5}], [{ cond=(NOT p3), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p3) p1), acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(AND (EQ s320 1) (EQ s342 1)), p3:(AND (EQ s22 1) (EQ s224 1)), p0:(AND (EQ s22 1) (EQ s224 1)), p1:(OR (EQ s22 0) (EQ s224 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 228 steps with 0 reset in 2 ms.
FORMULA Parking-PT-832-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-13 finished in 2695 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((G(p1)||p0))||F(p2)))'
Support contains 4 out of 654 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 654/654 places, 572/572 transitions.
Drop transitions 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 654 transition count 556
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 638 transition count 556
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 638 transition count 540
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 622 transition count 540
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 620 transition count 538
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 620 transition count 538
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 132 place count 588 transition count 506
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 134 place count 587 transition count 509
Applied a total of 134 rules in 90 ms. Remains 587 /654 variables (removed 67) and now considering 509/572 (removed 63) transitions.
// Phase 1: matrix 509 rows 587 cols
[2022-05-20 15:56:21] [INFO ] Computed 138 place invariants in 3 ms
[2022-05-20 15:56:21] [INFO ] Implicit Places using invariants in 417 ms returned [170, 502]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 420 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 585/654 places, 509/572 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
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 2 place count 584 transition count 524
Applied a total of 2 rules in 33 ms. Remains 584 /585 variables (removed 1) and now considering 524/509 (removed -15) transitions.
// Phase 1: matrix 524 rows 584 cols
[2022-05-20 15:56:21] [INFO ] Computed 136 place invariants in 1 ms
[2022-05-20 15:56:22] [INFO ] Implicit Places using invariants in 424 ms returned []
// Phase 1: matrix 524 rows 584 cols
[2022-05-20 15:56:22] [INFO ] Computed 136 place invariants in 3 ms
[2022-05-20 15:56:22] [INFO ] State equation strengthened by 220 read => feed constraints.
[2022-05-20 15:56:23] [INFO ] Implicit Places using invariants and state equation in 1380 ms returned []
Implicit Place search using SMT with State Equation took 1834 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 584/654 places, 524/572 transitions.
Finished structural reductions, in 2 iterations. Remains : 584/654 places, 524/572 transitions.
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2)]
Running random walk in product with property : Parking-PT-832-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s10 0) (EQ s151 0)), p2:(AND (EQ s63 1) (EQ s337 1)), p0:(OR (EQ s10 0) (EQ s151 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 525 reset in 840 ms.
Product exploration explored 100000 steps with 528 reset in 942 ms.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (AND p1 (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT p2)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X (AND p0 (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 483 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 108 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 52 resets, run finished after 415 ms. (steps per millisecond=24 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 524 rows 584 cols
[2022-05-20 15:56:26] [INFO ] Computed 136 place invariants in 3 ms
[2022-05-20 15:56:26] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2022-05-20 15:56:27] [INFO ] [Nat]Absence check using 136 positive place invariants in 39 ms returned sat
[2022-05-20 15:56:27] [INFO ] After 412ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2022-05-20 15:56:27] [INFO ] State equation strengthened by 220 read => feed constraints.
[2022-05-20 15:56:27] [INFO ] After 158ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2022-05-20 15:56:27] [INFO ] After 263ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 75 ms.
[2022-05-20 15:56:27] [INFO ] After 932ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 26 ms.
Support contains 4 out of 584 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 584/584 places, 524/524 transitions.
Free-agglomeration rule applied 161 times.
Iterating global reduction 0 with 161 rules applied. Total rules applied 161 place count 584 transition count 363
Reduce places removed 161 places and 0 transitions.
Graph (complete) has 858 edges and 423 vertex of which 178 are kept as prefixes of interest. Removing 245 places using SCC suffix rule.0 ms
Discarding 245 places :
Also discarding 180 output transitions
Drop transitions removed 180 transitions
Iterating post reduction 0 with 162 rules applied. Total rules applied 323 place count 178 transition count 183
Drop transitions removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 353 place count 178 transition count 153
Applied a total of 353 rules in 33 ms. Remains 178 /584 variables (removed 406) and now considering 153/524 (removed 371) transitions.
Finished structural reductions, in 1 iterations. Remains : 178/584 places, 153/524 transitions.
Finished random walk after 112 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=37 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (AND p1 (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT p2)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (G (NOT (AND p1 (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0) (NOT p2))), (F (NOT (AND p0 (NOT p2)))), (F p2), (F (NOT (AND p1 (NOT p2)))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 14 factoid took 629 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 65 ms :[(NOT p2), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 66 ms :[(NOT p2), (AND (NOT p2) (NOT p0))]
Support contains 4 out of 584 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 584/584 places, 524/524 transitions.
Applied a total of 0 rules in 21 ms. Remains 584 /584 variables (removed 0) and now considering 524/524 (removed 0) transitions.
// Phase 1: matrix 524 rows 584 cols
[2022-05-20 15:56:28] [INFO ] Computed 136 place invariants in 2 ms
[2022-05-20 15:56:29] [INFO ] Implicit Places using invariants in 541 ms returned []
// Phase 1: matrix 524 rows 584 cols
[2022-05-20 15:56:29] [INFO ] Computed 136 place invariants in 2 ms
[2022-05-20 15:56:29] [INFO ] State equation strengthened by 220 read => feed constraints.
[2022-05-20 15:56:30] [INFO ] Implicit Places using invariants and state equation in 1489 ms returned []
Implicit Place search using SMT with State Equation took 2033 ms to find 0 implicit places.
[2022-05-20 15:56:30] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 524 rows 584 cols
[2022-05-20 15:56:30] [INFO ] Computed 136 place invariants in 1 ms
[2022-05-20 15:56:31] [INFO ] Dead Transitions using invariants and state equation in 423 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 584/584 places, 524/524 transitions.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 252 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 65 ms :[(NOT p2), (AND (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 51 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 524 rows 584 cols
[2022-05-20 15:56:31] [INFO ] Computed 136 place invariants in 1 ms
[2022-05-20 15:56:31] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 15:56:31] [INFO ] [Nat]Absence check using 136 positive place invariants in 41 ms returned sat
[2022-05-20 15:56:32] [INFO ] After 344ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 15:56:32] [INFO ] State equation strengthened by 220 read => feed constraints.
[2022-05-20 15:56:32] [INFO ] After 104ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 15:56:32] [INFO ] After 184ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2022-05-20 15:56:32] [INFO ] After 734ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 4 out of 584 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 584/584 places, 524/524 transitions.
Free-agglomeration rule applied 161 times.
Iterating global reduction 0 with 161 rules applied. Total rules applied 161 place count 584 transition count 363
Reduce places removed 161 places and 0 transitions.
Graph (complete) has 858 edges and 423 vertex of which 178 are kept as prefixes of interest. Removing 245 places using SCC suffix rule.1 ms
Discarding 245 places :
Also discarding 180 output transitions
Drop transitions removed 180 transitions
Iterating post reduction 0 with 162 rules applied. Total rules applied 323 place count 178 transition count 183
Drop transitions removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 353 place count 178 transition count 153
Applied a total of 353 rules in 37 ms. Remains 178 /584 variables (removed 406) and now considering 153/524 (removed 371) transitions.
Finished structural reductions, in 1 iterations. Remains : 178/584 places, 153/524 transitions.
Finished random walk after 120 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=120 )
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F p2), (F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 7 factoid took 304 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 69 ms :[(NOT p2), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 66 ms :[(NOT p2), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 67 ms :[(NOT p2), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 527 reset in 829 ms.
Product exploration explored 100000 steps with 526 reset in 930 ms.
Built C files in :
/tmp/ltsmin3885600448661001962
[2022-05-20 15:56:34] [INFO ] Computing symmetric may disable matrix : 524 transitions.
[2022-05-20 15:56:34] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 15:56:34] [INFO ] Computing symmetric may enable matrix : 524 transitions.
[2022-05-20 15:56:34] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 15:56:34] [INFO ] Computing Do-Not-Accords matrix : 524 transitions.
[2022-05-20 15:56:34] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 15:56:34] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3885600448661001962
Running compilation step : cd /tmp/ltsmin3885600448661001962;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1928 ms.
Running link step : cd /tmp/ltsmin3885600448661001962;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin3885600448661001962;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9437927408614470132.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 584 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 584/584 places, 524/524 transitions.
Applied a total of 0 rules in 25 ms. Remains 584 /584 variables (removed 0) and now considering 524/524 (removed 0) transitions.
// Phase 1: matrix 524 rows 584 cols
[2022-05-20 15:56:49] [INFO ] Computed 136 place invariants in 2 ms
[2022-05-20 15:56:50] [INFO ] Implicit Places using invariants in 489 ms returned []
// Phase 1: matrix 524 rows 584 cols
[2022-05-20 15:56:50] [INFO ] Computed 136 place invariants in 1 ms
[2022-05-20 15:56:50] [INFO ] State equation strengthened by 220 read => feed constraints.
[2022-05-20 15:56:51] [INFO ] Implicit Places using invariants and state equation in 1533 ms returned []
Implicit Place search using SMT with State Equation took 2047 ms to find 0 implicit places.
[2022-05-20 15:56:52] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 524 rows 584 cols
[2022-05-20 15:56:52] [INFO ] Computed 136 place invariants in 2 ms
[2022-05-20 15:56:52] [INFO ] Dead Transitions using invariants and state equation in 449 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 584/584 places, 524/524 transitions.
Built C files in :
/tmp/ltsmin10037313358971867693
[2022-05-20 15:56:52] [INFO ] Computing symmetric may disable matrix : 524 transitions.
[2022-05-20 15:56:52] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 15:56:52] [INFO ] Computing symmetric may enable matrix : 524 transitions.
[2022-05-20 15:56:52] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 15:56:52] [INFO ] Computing Do-Not-Accords matrix : 524 transitions.
[2022-05-20 15:56:52] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 15:56:52] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10037313358971867693
Running compilation step : cd /tmp/ltsmin10037313358971867693;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1904 ms.
Running link step : cd /tmp/ltsmin10037313358971867693;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin10037313358971867693;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17211718287490001678.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 15:57:07] [INFO ] Flatten gal took : 39 ms
[2022-05-20 15:57:07] [INFO ] Flatten gal took : 38 ms
[2022-05-20 15:57:07] [INFO ] Time to serialize gal into /tmp/LTL16137667414189448587.gal : 4 ms
[2022-05-20 15:57:07] [INFO ] Time to serialize properties into /tmp/LTL16841315253278815565.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16137667414189448587.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16841315253278815565.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1613766...268
Read 1 LTL properties
Checking formula 0 : !(((G(((G("((p10==0)||(p166==0))"))||("(p10==0)"))||("(p166==0)")))||(F("((p63==1)&&(p410==1))"))))
Formula 0 simplified : !(G("(p10==0)" | "(p166==0)" | G"((p10==0)||(p166==0))") | F"((p63==1)&&(p410==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.
[2022-05-20 15:57:22] [INFO ] Flatten gal took : 37 ms
[2022-05-20 15:57:22] [INFO ] Applying decomposition
[2022-05-20 15:57:22] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13815145556645242058.txt' '-o' '/tmp/graph13815145556645242058.bin' '-w' '/tmp/graph13815145556645242058.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13815145556645242058.bin' '-l' '-1' '-v' '-w' '/tmp/graph13815145556645242058.weights' '-q' '0' '-e' '0.001'
[2022-05-20 15:57:22] [INFO ] Decomposing Gal with order
[2022-05-20 15:57:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 15:57:22] [INFO ] Removed a total of 708 redundant transitions.
[2022-05-20 15:57:22] [INFO ] Flatten gal took : 66 ms
[2022-05-20 15:57:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 28 ms.
[2022-05-20 15:57:23] [INFO ] Time to serialize gal into /tmp/LTL5192758884977235363.gal : 11 ms
[2022-05-20 15:57:23] [INFO ] Time to serialize properties into /tmp/LTL7333158271732055261.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5192758884977235363.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7333158271732055261.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5192758...245
Read 1 LTL properties
Checking formula 0 : !(((G(((G("((i1.u4.p10==0)||(i0.u69.p166==0))"))||("(i1.u4.p10==0)"))||("(i0.u69.p166==0)")))||(F("((i7.u31.p63==1)&&(i7.u141.p410==1)...161
Formula 0 simplified : !(G("(i0.u69.p166==0)" | "(i1.u4.p10==0)" | G"((i1.u4.p10==0)||(i0.u69.p166==0))") | F"((i7.u31.p63==1)&&(i7.u141.p410==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.
Built C files in :
/tmp/ltsmin10287278588823646109
[2022-05-20 15:57:38] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10287278588823646109
Running compilation step : cd /tmp/ltsmin10287278588823646109;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1362 ms.
Running link step : cd /tmp/ltsmin10287278588823646109;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin10287278588823646109;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](([]((LTLAPp1==true))||(LTLAPp0==true)))||<>((LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Parking-PT-832-LTLFireability-14 finished in 91951 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(p0))))'
Support contains 1 out of 654 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 654/654 places, 572/572 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 652 transition count 570
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 652 transition count 570
Applied a total of 4 rules in 36 ms. Remains 652 /654 variables (removed 2) and now considering 570/572 (removed 2) transitions.
// Phase 1: matrix 570 rows 652 cols
[2022-05-20 15:57:53] [INFO ] Computed 138 place invariants in 2 ms
[2022-05-20 15:57:53] [INFO ] Implicit Places using invariants in 455 ms returned [177, 558]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 470 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 650/654 places, 570/572 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 30 ms. Remains 649 /650 variables (removed 1) and now considering 569/570 (removed 1) transitions.
// Phase 1: matrix 569 rows 649 cols
[2022-05-20 15:57:53] [INFO ] Computed 136 place invariants in 2 ms
[2022-05-20 15:57:54] [INFO ] Implicit Places using invariants in 429 ms returned []
// Phase 1: matrix 569 rows 649 cols
[2022-05-20 15:57:54] [INFO ] Computed 136 place invariants in 2 ms
[2022-05-20 15:57:54] [INFO ] State equation strengthened by 152 read => feed constraints.
[2022-05-20 15:57:55] [INFO ] Implicit Places using invariants and state equation in 1143 ms returned []
Implicit Place search using SMT with State Equation took 1596 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 649/654 places, 569/572 transitions.
Finished structural reductions, in 2 iterations. Remains : 649/654 places, 569/572 transitions.
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-832-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s473 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1807 steps with 8 reset in 14 ms.
FORMULA Parking-PT-832-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-15 finished in 2288 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!G(p0) U G(!p0)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((G(p1)||p0))||F(p2)))'
[2022-05-20 15:57:55] [INFO ] Flatten gal took : 24 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14092617414289451676
[2022-05-20 15:57:55] [INFO ] Computing symmetric may disable matrix : 572 transitions.
[2022-05-20 15:57:55] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 15:57:55] [INFO ] Computing symmetric may enable matrix : 572 transitions.
[2022-05-20 15:57:55] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 15:57:55] [INFO ] Applying decomposition
[2022-05-20 15:57:55] [INFO ] Computing Do-Not-Accords matrix : 572 transitions.
[2022-05-20 15:57:55] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 15:57:55] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14092617414289451676
Running compilation step : cd /tmp/ltsmin14092617414289451676;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-20 15:57:55] [INFO ] Flatten gal took : 40 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph370479504817114250.txt' '-o' '/tmp/graph370479504817114250.bin' '-w' '/tmp/graph370479504817114250.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph370479504817114250.bin' '-l' '-1' '-v' '-w' '/tmp/graph370479504817114250.weights' '-q' '0' '-e' '0.001'
[2022-05-20 15:57:56] [INFO ] Decomposing Gal with order
[2022-05-20 15:57:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 15:57:56] [INFO ] Removed a total of 50 redundant transitions.
[2022-05-20 15:57:56] [INFO ] Flatten gal took : 64 ms
[2022-05-20 15:57:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 14 ms.
[2022-05-20 15:57:56] [INFO ] Time to serialize gal into /tmp/LTLFireability1793429157196535001.gal : 7 ms
[2022-05-20 15:57:56] [INFO ] Time to serialize properties into /tmp/LTLFireability17959218906717824586.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1793429157196535001.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17959218906717824586.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 2 LTL properties
Checking formula 0 : !(((!(G("((i11.i1.i0.u32.p66==1)&&(i11.i1.i0.u164.p478==1))")))U(G(!("((i11.i1.i0.u32.p66==1)&&(i11.i1.i0.u164.p478==1))")))))
Formula 0 simplified : !(!G"((i11.i1.i0.u32.p66==1)&&(i11.i1.i0.u164.p478==1))" U G!"((i11.i1.i0.u32.p66==1)&&(i11.i1.i0.u164.p478==1))")
Compilation finished in 2099 ms.
Running link step : cd /tmp/ltsmin14092617414289451676;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin14092617414289451676;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '() U [](!(LTLAPp0==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions i4.i1.i2.u220.t20, i5.u81.t129, i6.u105.t111, i8.u127.t93, i10.u150.t75, i12.u173.t57, i13.t4...330
Computing Next relation with stutter on 7.8311e+10 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
5904 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,59.1574,842800,1,0,963093,3533,9019,7.01486e+06,621,12972,613427
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-832-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((G(((G("((i0.i0.i1.u4.p10==0)||(i0.i1.i0.u72.p166==0))"))||("(i0.i0.i1.u4.p10==0)"))||("(i0.i1.i0.u72.p166==0)")))||(F("((i7.i1.i1....191
Formula 1 simplified : !(G("(i0.i0.i1.u4.p10==0)" | "(i0.i1.i0.u72.p166==0)" | G"((i0.i0.i1.u4.p10==0)||(i0.i1.i0.u72.p166==0))") | F"((i7.i1.i1.u31.p63==1...178
Computing Next relation with stutter on 7.8311e+10 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
8817 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,147.327,1715256,1,0,2.83562e+06,3584,9201,1.08308e+07,626,13409,1948439
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Parking-PT-832-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 679687 ms.

BK_STOP 1653062651797

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-4028"
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 r150-smll-165276998700332"
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 ;