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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 672K
-rw-r--r-- 1 mcc users 6.6K Apr 30 07:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 30 07:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 30 06:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 30 06:35 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 4.1K May 9 08:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K 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 17K 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 427K 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-864-LTLFireability-00
FORMULA_NAME Parking-PT-864-LTLFireability-01
FORMULA_NAME Parking-PT-864-LTLFireability-02
FORMULA_NAME Parking-PT-864-LTLFireability-03
FORMULA_NAME Parking-PT-864-LTLFireability-04
FORMULA_NAME Parking-PT-864-LTLFireability-05
FORMULA_NAME Parking-PT-864-LTLFireability-06
FORMULA_NAME Parking-PT-864-LTLFireability-07
FORMULA_NAME Parking-PT-864-LTLFireability-08
FORMULA_NAME Parking-PT-864-LTLFireability-09
FORMULA_NAME Parking-PT-864-LTLFireability-10
FORMULA_NAME Parking-PT-864-LTLFireability-11
FORMULA_NAME Parking-PT-864-LTLFireability-12
FORMULA_NAME Parking-PT-864-LTLFireability-13
FORMULA_NAME Parking-PT-864-LTLFireability-14
FORMULA_NAME Parking-PT-864-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653066472195

Running Version 202205111006
[2022-05-20 17:07:53] [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 17:07:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 17:07:54] [INFO ] Load time of PNML (sax parser for PT used): 284 ms
[2022-05-20 17:07:54] [INFO ] Transformed 1185 places.
[2022-05-20 17:07:54] [INFO ] Transformed 1697 transitions.
[2022-05-20 17:07:54] [INFO ] Found NUPN structural information;
[2022-05-20 17:07:54] [INFO ] Parsed PT model containing 1185 places and 1697 transitions in 488 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 688 transitions
Reduce redundant transitions removed 688 transitions.
FORMULA Parking-PT-864-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 1185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1185/1185 places, 1009/1009 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1177 transition count 1001
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1177 transition count 1001
Applied a total of 16 rules in 277 ms. Remains 1177 /1185 variables (removed 8) and now considering 1001/1009 (removed 8) transitions.
// Phase 1: matrix 1001 rows 1177 cols
[2022-05-20 17:07:55] [INFO ] Computed 280 place invariants in 68 ms
[2022-05-20 17:07:56] [INFO ] Implicit Places using invariants in 1784 ms returned []
// Phase 1: matrix 1001 rows 1177 cols
[2022-05-20 17:07:56] [INFO ] Computed 280 place invariants in 25 ms
[2022-05-20 17:07:58] [INFO ] State equation strengthened by 248 read => feed constraints.
[2022-05-20 17:08:01] [INFO ] Implicit Places using invariants and state equation in 4608 ms returned [152, 160, 168, 176, 184, 192, 200, 208, 240, 242, 285, 293, 301, 309, 317, 325, 333, 341, 373, 418, 426, 434, 442, 450, 458, 466, 474, 506, 508, 551, 559, 567, 575, 583, 591, 599, 607, 639, 641, 684, 692, 700, 708, 716, 724, 732, 740, 772, 774, 817, 825, 833, 841, 849, 857, 865, 873, 905, 907, 958, 966, 974, 982, 990, 998, 1006, 1038, 1040, 1083, 1091, 1099, 1107, 1115, 1123, 1131, 1139, 1171, 1173]
Discarding 78 places :
Implicit Place search using SMT with State Equation took 6461 ms to find 78 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1099/1185 places, 1001/1009 transitions.
Discarding 62 places :
Symmetric choice reduction at 0 with 62 rule applications. Total rules 62 place count 1037 transition count 939
Iterating global reduction 0 with 62 rules applied. Total rules applied 124 place count 1037 transition count 939
Applied a total of 124 rules in 296 ms. Remains 1037 /1099 variables (removed 62) and now considering 939/1001 (removed 62) transitions.
// Phase 1: matrix 939 rows 1037 cols
[2022-05-20 17:08:01] [INFO ] Computed 202 place invariants in 9 ms
[2022-05-20 17:08:02] [INFO ] Implicit Places using invariants in 928 ms returned []
// Phase 1: matrix 939 rows 1037 cols
[2022-05-20 17:08:02] [INFO ] Computed 202 place invariants in 5 ms
[2022-05-20 17:08:03] [INFO ] State equation strengthened by 248 read => feed constraints.
[2022-05-20 17:08:05] [INFO ] Implicit Places using invariants and state equation in 2781 ms returned []
Implicit Place search using SMT with State Equation took 3716 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1037/1185 places, 939/1009 transitions.
Finished structural reductions, in 2 iterations. Remains : 1037/1185 places, 939/1009 transitions.
Support contains 40 out of 1037 places after structural reductions.
[2022-05-20 17:08:06] [INFO ] Flatten gal took : 187 ms
[2022-05-20 17:08:06] [INFO ] Flatten gal took : 106 ms
[2022-05-20 17:08:06] [INFO ] Input system was already deterministic with 939 transitions.
Incomplete random walk after 10000 steps, including 39 resets, run finished after 897 ms. (steps per millisecond=11 ) properties (out of 30) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 939 rows 1037 cols
[2022-05-20 17:08:07] [INFO ] Computed 202 place invariants in 5 ms
[2022-05-20 17:08:08] [INFO ] [Real]Absence check using 202 positive place invariants in 68 ms returned sat
[2022-05-20 17:08:08] [INFO ] After 801ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2022-05-20 17:08:09] [INFO ] [Nat]Absence check using 202 positive place invariants in 65 ms returned sat
[2022-05-20 17:08:10] [INFO ] After 1093ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2022-05-20 17:08:10] [INFO ] State equation strengthened by 248 read => feed constraints.
[2022-05-20 17:08:11] [INFO ] After 987ms SMT Verify possible using 248 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2022-05-20 17:08:12] [INFO ] After 2451ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 1275 ms.
[2022-05-20 17:08:14] [INFO ] After 5534ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 6 properties in 704 ms.
Support contains 9 out of 1037 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1037/1037 places, 939/939 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 1037 transition count 908
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 1006 transition count 908
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 62 place count 1006 transition count 877
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 124 place count 975 transition count 877
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 125 place count 974 transition count 876
Iterating global reduction 2 with 1 rules applied. Total rules applied 126 place count 974 transition count 876
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 2 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 220 place count 927 transition count 829
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
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 222 place count 926 transition count 836
Free-agglomeration rule applied 250 times.
Iterating global reduction 2 with 250 rules applied. Total rules applied 472 place count 926 transition count 586
Reduce places removed 250 places and 0 transitions.
Graph (complete) has 1366 edges and 676 vertex of which 601 are kept as prefixes of interest. Removing 75 places using SCC suffix rule.10 ms
Discarding 75 places :
Also discarding 56 output transitions
Drop transitions removed 56 transitions
Iterating post reduction 2 with 251 rules applied. Total rules applied 723 place count 601 transition count 530
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 737 place count 601 transition count 516
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 738 place count 601 transition count 515
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 739 place count 600 transition count 515
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 740 place count 600 transition count 515
Applied a total of 740 rules in 507 ms. Remains 600 /1037 variables (removed 437) and now considering 515/939 (removed 424) transitions.
Finished structural reductions, in 1 iterations. Remains : 600/1037 places, 515/939 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 515 rows 600 cols
[2022-05-20 17:08:15] [INFO ] Computed 184 place invariants in 5 ms
[2022-05-20 17:08:15] [INFO ] [Real]Absence check using 184 positive place invariants in 69 ms returned sat
[2022-05-20 17:08:16] [INFO ] After 681ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 17:08:16] [INFO ] [Nat]Absence check using 184 positive place invariants in 53 ms returned sat
[2022-05-20 17:08:16] [INFO ] After 317ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 17:08:16] [INFO ] State equation strengthened by 495 read => feed constraints.
[2022-05-20 17:08:16] [INFO ] After 124ms SMT Verify possible using 495 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 17:08:16] [INFO ] After 180ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 60 ms.
[2022-05-20 17:08:17] [INFO ] After 756ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 11 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=3 )
Parikh walk visited 1 properties in 3 ms.
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' '!(((p0 U p1) U G(X(p0))))'
Support contains 2 out of 1037 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1037/1037 places, 939/939 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1036 transition count 938
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1036 transition count 938
Applied a total of 2 rules in 93 ms. Remains 1036 /1037 variables (removed 1) and now considering 938/939 (removed 1) transitions.
// Phase 1: matrix 938 rows 1036 cols
[2022-05-20 17:08:17] [INFO ] Computed 202 place invariants in 7 ms
[2022-05-20 17:08:18] [INFO ] Implicit Places using invariants in 1097 ms returned [340, 843]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1101 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1034/1037 places, 938/939 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1033 transition count 937
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1033 transition count 937
Applied a total of 2 rules in 61 ms. Remains 1033 /1034 variables (removed 1) and now considering 937/938 (removed 1) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2022-05-20 17:08:18] [INFO ] Computed 200 place invariants in 7 ms
[2022-05-20 17:08:19] [INFO ] Implicit Places using invariants in 986 ms returned []
// Phase 1: matrix 937 rows 1033 cols
[2022-05-20 17:08:19] [INFO ] Computed 200 place invariants in 7 ms
[2022-05-20 17:08:20] [INFO ] State equation strengthened by 248 read => feed constraints.
[2022-05-20 17:08:22] [INFO ] Implicit Places using invariants and state equation in 2936 ms returned []
Implicit Place search using SMT with State Equation took 3927 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1033/1037 places, 937/939 transitions.
Finished structural reductions, in 2 iterations. Remains : 1033/1037 places, 937/939 transitions.
Stuttering acceptance computed with spot in 458 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : Parking-PT-864-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(EQ s20 1), p1:(EQ s638 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 148 steps with 0 reset in 12 ms.
FORMULA Parking-PT-864-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-01 finished in 5749 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(X(X((!p0 U p1)))) U p2) U (!F(p2)||p3)))'
Support contains 5 out of 1037 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1037/1037 places, 939/939 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1036 transition count 938
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1036 transition count 938
Applied a total of 2 rules in 77 ms. Remains 1036 /1037 variables (removed 1) and now considering 938/939 (removed 1) transitions.
// Phase 1: matrix 938 rows 1036 cols
[2022-05-20 17:08:23] [INFO ] Computed 202 place invariants in 7 ms
[2022-05-20 17:08:24] [INFO ] Implicit Places using invariants in 789 ms returned [340]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 793 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1035/1037 places, 938/939 transitions.
Applied a total of 0 rules in 30 ms. Remains 1035 /1035 variables (removed 0) and now considering 938/938 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1035/1037 places, 938/939 transitions.
Stuttering acceptance computed with spot in 284 ms :[(AND p2 (NOT p3)), (AND (NOT p1) p2), (NOT p1), (AND (NOT p1) p2), true, (NOT p1), p2]
Running random walk in product with property : Parking-PT-864-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(OR p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=(OR (AND p2 p1) (AND p2 (NOT p0))), acceptance={} source=3 dest: 2}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0))), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 5}], [{ cond=p2, acceptance={} source=6 dest: 4}, { cond=(NOT p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p3:(EQ s882 1), p2:(EQ s391 1), p1:(EQ s806 1), p0:(AND (EQ s842 1) (EQ s916 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1066 steps with 3 reset in 49 ms.
FORMULA Parking-PT-864-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-02 finished in 1265 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||F(p1)))))'
Support contains 3 out of 1037 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1037/1037 places, 939/939 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1037 transition count 907
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1005 transition count 907
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 64 place count 1005 transition count 875
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 128 place count 973 transition count 875
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 129 place count 972 transition count 874
Iterating global reduction 2 with 1 rules applied. Total rules applied 130 place count 972 transition count 874
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 224 place count 925 transition count 827
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
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 226 place count 924 transition count 834
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 227 place count 924 transition count 834
Applied a total of 227 rules in 257 ms. Remains 924 /1037 variables (removed 113) and now considering 834/939 (removed 105) transitions.
// Phase 1: matrix 834 rows 924 cols
[2022-05-20 17:08:24] [INFO ] Computed 202 place invariants in 4 ms
[2022-05-20 17:08:25] [INFO ] Implicit Places using invariants in 882 ms returned [314, 758]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 885 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 922/1037 places, 834/939 transitions.
Applied a total of 0 rules in 62 ms. Remains 922 /922 variables (removed 0) and now considering 834/834 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 922/1037 places, 834/939 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-864-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s80 1), p1:(OR (NEQ s130 1) (NEQ s164 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 396 reset in 1724 ms.
Product exploration explored 100000 steps with 395 reset in 1446 ms.
Computed a total of 1 stabilizing places and 9 stable transitions
Computed a total of 1 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 201 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 39 resets, run finished after 261 ms. (steps per millisecond=38 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 153057 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 153057 steps, saw 82873 distinct states, run finished after 3003 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 834 rows 922 cols
[2022-05-20 17:08:32] [INFO ] Computed 200 place invariants in 11 ms
[2022-05-20 17:08:32] [INFO ] [Real]Absence check using 200 positive place invariants in 56 ms returned sat
[2022-05-20 17:08:33] [INFO ] After 1008ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 17:08:33] [INFO ] [Nat]Absence check using 200 positive place invariants in 69 ms returned sat
[2022-05-20 17:08:34] [INFO ] After 671ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 17:08:34] [INFO ] State equation strengthened by 344 read => feed constraints.
[2022-05-20 17:08:34] [INFO ] After 264ms SMT Verify possible using 344 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-20 17:08:35] [INFO ] After 467ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 126 ms.
[2022-05-20 17:08:35] [INFO ] After 1619ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 228 steps, including 0 resets, run visited all 2 properties in 12 ms. (steps per millisecond=19 )
Parikh walk visited 2 properties in 13 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 269 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 922 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 922/922 places, 834/834 transitions.
Applied a total of 0 rules in 83 ms. Remains 922 /922 variables (removed 0) and now considering 834/834 (removed 0) transitions.
// Phase 1: matrix 834 rows 922 cols
[2022-05-20 17:08:35] [INFO ] Computed 200 place invariants in 7 ms
[2022-05-20 17:08:36] [INFO ] Implicit Places using invariants in 968 ms returned []
// Phase 1: matrix 834 rows 922 cols
[2022-05-20 17:08:36] [INFO ] Computed 200 place invariants in 4 ms
[2022-05-20 17:08:37] [INFO ] State equation strengthened by 344 read => feed constraints.
[2022-05-20 17:08:40] [INFO ] Implicit Places using invariants and state equation in 3388 ms returned []
Implicit Place search using SMT with State Equation took 4358 ms to find 0 implicit places.
[2022-05-20 17:08:40] [INFO ] Redundant transitions in 102 ms returned []
// Phase 1: matrix 834 rows 922 cols
[2022-05-20 17:08:40] [INFO ] Computed 200 place invariants in 3 ms
[2022-05-20 17:08:41] [INFO ] Dead Transitions using invariants and state equation in 1076 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 922/922 places, 834/834 transitions.
Computed a total of 1 stabilizing places and 9 stable transitions
Computed a total of 1 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 246 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 40 resets, run finished after 406 ms. (steps per millisecond=24 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 190169 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :{}
Probabilistic random walk after 190169 steps, saw 87680 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 834 rows 922 cols
[2022-05-20 17:08:45] [INFO ] Computed 200 place invariants in 3 ms
[2022-05-20 17:08:45] [INFO ] [Real]Absence check using 200 positive place invariants in 68 ms returned sat
[2022-05-20 17:08:46] [INFO ] After 957ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 17:08:46] [INFO ] [Nat]Absence check using 200 positive place invariants in 92 ms returned sat
[2022-05-20 17:08:47] [INFO ] After 796ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 17:08:47] [INFO ] State equation strengthened by 344 read => feed constraints.
[2022-05-20 17:08:47] [INFO ] After 240ms SMT Verify possible using 344 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-20 17:08:47] [INFO ] After 411ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 115 ms.
[2022-05-20 17:08:48] [INFO ] After 1747ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 227 steps, including 0 resets, run visited all 2 properties in 15 ms. (steps per millisecond=15 )
Parikh walk visited 2 properties in 15 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 237 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 393 reset in 1457 ms.
Product exploration explored 100000 steps with 396 reset in 1333 ms.
Built C files in :
/tmp/ltsmin17545306150943335416
[2022-05-20 17:08:51] [INFO ] Computing symmetric may disable matrix : 834 transitions.
[2022-05-20 17:08:51] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 17:08:51] [INFO ] Computing symmetric may enable matrix : 834 transitions.
[2022-05-20 17:08:51] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 17:08:51] [INFO ] Computing Do-Not-Accords matrix : 834 transitions.
[2022-05-20 17:08:51] [INFO ] Computation of Completed DNA matrix. took 33 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 17:08:51] [INFO ] Built C files in 232ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17545306150943335416
Running compilation step : cd /tmp/ltsmin17545306150943335416;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17545306150943335416;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17545306150943335416;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 3 out of 922 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 922/922 places, 834/834 transitions.
Applied a total of 0 rules in 73 ms. Remains 922 /922 variables (removed 0) and now considering 834/834 (removed 0) transitions.
// Phase 1: matrix 834 rows 922 cols
[2022-05-20 17:08:54] [INFO ] Computed 200 place invariants in 4 ms
[2022-05-20 17:08:55] [INFO ] Implicit Places using invariants in 722 ms returned []
// Phase 1: matrix 834 rows 922 cols
[2022-05-20 17:08:55] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-20 17:08:56] [INFO ] State equation strengthened by 344 read => feed constraints.
[2022-05-20 17:08:58] [INFO ] Implicit Places using invariants and state equation in 3228 ms returned []
Implicit Place search using SMT with State Equation took 3958 ms to find 0 implicit places.
[2022-05-20 17:08:58] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 834 rows 922 cols
[2022-05-20 17:08:58] [INFO ] Computed 200 place invariants in 5 ms
[2022-05-20 17:08:59] [INFO ] Dead Transitions using invariants and state equation in 1027 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 922/922 places, 834/834 transitions.
Built C files in :
/tmp/ltsmin15007917378487301404
[2022-05-20 17:08:59] [INFO ] Computing symmetric may disable matrix : 834 transitions.
[2022-05-20 17:08:59] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 17:08:59] [INFO ] Computing symmetric may enable matrix : 834 transitions.
[2022-05-20 17:08:59] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 17:08:59] [INFO ] Computing Do-Not-Accords matrix : 834 transitions.
[2022-05-20 17:08:59] [INFO ] Computation of Completed DNA matrix. took 53 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 17:08:59] [INFO ] Built C files in 226ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15007917378487301404
Running compilation step : cd /tmp/ltsmin15007917378487301404;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15007917378487301404;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15007917378487301404;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 17:09:03] [INFO ] Flatten gal took : 282 ms
[2022-05-20 17:09:03] [INFO ] Flatten gal took : 113 ms
[2022-05-20 17:09:03] [INFO ] Time to serialize gal into /tmp/LTL6301503261874197466.gal : 14 ms
[2022-05-20 17:09:03] [INFO ] Time to serialize properties into /tmp/LTL9559185845416918248.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/LTL6301503261874197466.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9559185845416918248.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/LTL6301503...266
Read 1 LTL properties
Checking formula 0 : !((F(G(("(p80!=1)")||(F("((p130!=1)||(p179!=1))"))))))
Formula 0 simplified : !FG("(p80!=1)" | F"((p130!=1)||(p179!=1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 5.35201e+12 deadlock states
Detected timeout of ITS tools.
[2022-05-20 17:09:18] [INFO ] Flatten gal took : 86 ms
[2022-05-20 17:09:18] [INFO ] Applying decomposition
[2022-05-20 17:09:18] [INFO ] Flatten gal took : 88 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/graph8678780306726416260.txt' '-o' '/tmp/graph8678780306726416260.bin' '-w' '/tmp/graph8678780306726416260.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8678780306726416260.bin' '-l' '-1' '-v' '-w' '/tmp/graph8678780306726416260.weights' '-q' '0' '-e' '0.001'
[2022-05-20 17:09:19] [INFO ] Decomposing Gal with order
[2022-05-20 17:09:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 17:09:19] [INFO ] Removed a total of 1839 redundant transitions.
[2022-05-20 17:09:19] [INFO ] Flatten gal took : 246 ms
[2022-05-20 17:09:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 144 labels/synchronizations in 214 ms.
[2022-05-20 17:09:19] [INFO ] Time to serialize gal into /tmp/LTL10838888877485837916.gal : 28 ms
[2022-05-20 17:09:19] [INFO ] Time to serialize properties into /tmp/LTL2700212120123338654.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/LTL10838888877485837916.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2700212120123338654.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/LTL1083888...246
Read 1 LTL properties
Checking formula 0 : !((F(G(("(i13.i0.i2.u40.p80!=1)")||(F("((i2.u65.p130!=1)||(i2.u78.p179!=1))"))))))
Formula 0 simplified : !FG("(i13.i0.i2.u40.p80!=1)" | F"((i2.u65.p130!=1)||(i2.u78.p179!=1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 5.35201e+12 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
582 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,5.98336,175072,1,0,242673,946,7625,1.17995e+06,331,2234,227078
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-864-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property Parking-PT-864-LTLFireability-03 finished in 62373 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(F(!(F(G(p1)) U p2)))))'
Support contains 4 out of 1037 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1037/1037 places, 939/939 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1037 transition count 907
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1005 transition count 907
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 64 place count 1005 transition count 875
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 973 transition count 875
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 129 place count 972 transition count 874
Iterating global reduction 2 with 1 rules applied. Total rules applied 130 place count 972 transition count 874
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 224 place count 925 transition count 827
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
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 226 place count 924 transition count 834
Applied a total of 226 rules in 238 ms. Remains 924 /1037 variables (removed 113) and now considering 834/939 (removed 105) transitions.
// Phase 1: matrix 834 rows 924 cols
[2022-05-20 17:09:27] [INFO ] Computed 202 place invariants in 3 ms
[2022-05-20 17:09:28] [INFO ] Implicit Places using invariants in 1039 ms returned [313, 757]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1044 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 922/1037 places, 834/939 transitions.
Applied a total of 0 rules in 67 ms. Remains 922 /922 variables (removed 0) and now considering 834/834 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 922/1037 places, 834/939 transitions.
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p0) p2), p2, p2, (AND p2 p1), (AND p2 p1)]
Running random walk in product with property : Parking-PT-864-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=p2, acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND p1 p2), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p1 p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s223 1), p2:(AND (EQ s767 1) (EQ s820 1)), p1:(AND (EQ s140 1) (EQ s767 1) (EQ s820 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 394 reset in 1611 ms.
Product exploration explored 100000 steps with 397 reset in 1622 ms.
Computed a total of 1 stabilizing places and 9 stable transitions
Computed a total of 1 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X p0), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 8 factoid took 359 ms. Reduced automaton from 5 states, 11 edges and 3 AP to 5 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 189 ms :[p2, p2, p2, (AND p2 p1), (AND p2 p1)]
Incomplete random walk after 10000 steps, including 40 resets, run finished after 450 ms. (steps per millisecond=22 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 178011 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :{}
Probabilistic random walk after 178011 steps, saw 86195 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 834 rows 922 cols
[2022-05-20 17:09:35] [INFO ] Computed 200 place invariants in 4 ms
[2022-05-20 17:09:36] [INFO ] [Real]Absence check using 200 positive place invariants in 102 ms returned sat
[2022-05-20 17:09:37] [INFO ] After 1295ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2022-05-20 17:09:37] [INFO ] [Nat]Absence check using 200 positive place invariants in 65 ms returned sat
[2022-05-20 17:09:38] [INFO ] After 740ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2022-05-20 17:09:38] [INFO ] State equation strengthened by 332 read => feed constraints.
[2022-05-20 17:09:38] [INFO ] After 246ms SMT Verify possible using 332 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2022-05-20 17:09:38] [INFO ] After 473ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 166 ms.
[2022-05-20 17:09:38] [INFO ] After 1713ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 231 steps, including 1 resets, run visited all 2 properties in 17 ms. (steps per millisecond=13 )
Parikh walk visited 2 properties in 16 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X p0), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p1 p2)))), (G (NOT (AND p1 (NOT p2))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p2), (F (AND p1 p2))]
Knowledge based reduction with 9 factoid took 615 ms. Reduced automaton from 5 states, 9 edges and 2 AP to 5 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 237 ms :[p2, (OR p1 p2), p2, p1, p1]
Stuttering acceptance computed with spot in 220 ms :[p2, (OR p1 p2), p2, p1, p1]
Support contains 3 out of 922 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 922/922 places, 834/834 transitions.
Applied a total of 0 rules in 41 ms. Remains 922 /922 variables (removed 0) and now considering 834/834 (removed 0) transitions.
// Phase 1: matrix 834 rows 922 cols
[2022-05-20 17:09:40] [INFO ] Computed 200 place invariants in 4 ms
[2022-05-20 17:09:41] [INFO ] Implicit Places using invariants in 1190 ms returned []
// Phase 1: matrix 834 rows 922 cols
[2022-05-20 17:09:41] [INFO ] Computed 200 place invariants in 7 ms
[2022-05-20 17:09:42] [INFO ] State equation strengthened by 332 read => feed constraints.
[2022-05-20 17:09:45] [INFO ] Implicit Places using invariants and state equation in 4456 ms returned []
Implicit Place search using SMT with State Equation took 5655 ms to find 0 implicit places.
// Phase 1: matrix 834 rows 922 cols
[2022-05-20 17:09:45] [INFO ] Computed 200 place invariants in 3 ms
[2022-05-20 17:09:46] [INFO ] Dead Transitions using invariants and state equation in 1085 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 922/922 places, 834/834 transitions.
Computed a total of 1 stabilizing places and 9 stable transitions
Computed a total of 1 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1)), (X (NOT p2)), (X (X (NOT p2))), true]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 160 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 5 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 177 ms :[p2, (OR p1 p2), p2, p1, p1]
Incomplete random walk after 10000 steps, including 39 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 834 rows 922 cols
[2022-05-20 17:09:47] [INFO ] Computed 200 place invariants in 7 ms
[2022-05-20 17:09:47] [INFO ] [Real]Absence check using 200 positive place invariants in 89 ms returned sat
[2022-05-20 17:09:48] [INFO ] After 1062ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 17:09:48] [INFO ] [Nat]Absence check using 200 positive place invariants in 57 ms returned sat
[2022-05-20 17:09:49] [INFO ] After 755ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 17:09:49] [INFO ] State equation strengthened by 332 read => feed constraints.
[2022-05-20 17:09:50] [INFO ] After 878ms SMT Verify possible using 332 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 17:09:50] [INFO ] After 1105ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 195 ms.
[2022-05-20 17:09:50] [INFO ] After 2293ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 190 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=21 )
Parikh walk visited 1 properties in 8 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p1)), (X (NOT p2)), (X (X (NOT p2))), true]
False Knowledge obtained : [(F p2), (F p1)]
Knowledge based reduction with 4 factoid took 252 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 5 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 224 ms :[p2, (OR p1 p2), p2, p1, p1]
Stuttering acceptance computed with spot in 228 ms :[p2, (OR p1 p2), p2, p1, p1]
Stuttering acceptance computed with spot in 201 ms :[p2, (OR p1 p2), p2, p1, p1]
Product exploration explored 100000 steps with 395 reset in 1404 ms.
Product exploration explored 100000 steps with 391 reset in 1320 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 213 ms :[p2, (OR p1 p2), p2, p1, p1]
Support contains 3 out of 922 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 922/922 places, 834/834 transitions.
Applied a total of 0 rules in 139 ms. Remains 922 /922 variables (removed 0) and now considering 834/834 (removed 0) transitions.
[2022-05-20 17:09:55] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 834 rows 922 cols
[2022-05-20 17:09:55] [INFO ] Computed 200 place invariants in 5 ms
[2022-05-20 17:09:56] [INFO ] Dead Transitions using invariants and state equation in 1133 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 922/922 places, 834/834 transitions.
Product exploration explored 100000 steps with 396 reset in 1352 ms.
Product exploration explored 100000 steps with 395 reset in 1309 ms.
Built C files in :
/tmp/ltsmin2408569388395745054
[2022-05-20 17:09:58] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2408569388395745054
Running compilation step : cd /tmp/ltsmin2408569388395745054;'/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 2378 ms.
Running link step : cd /tmp/ltsmin2408569388395745054;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin2408569388395745054;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13318383984304882738.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 922 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 922/922 places, 834/834 transitions.
Applied a total of 0 rules in 18 ms. Remains 922 /922 variables (removed 0) and now considering 834/834 (removed 0) transitions.
// Phase 1: matrix 834 rows 922 cols
[2022-05-20 17:10:13] [INFO ] Computed 200 place invariants in 4 ms
[2022-05-20 17:10:14] [INFO ] Implicit Places using invariants in 955 ms returned []
// Phase 1: matrix 834 rows 922 cols
[2022-05-20 17:10:14] [INFO ] Computed 200 place invariants in 3 ms
[2022-05-20 17:10:15] [INFO ] State equation strengthened by 332 read => feed constraints.
[2022-05-20 17:10:18] [INFO ] Implicit Places using invariants and state equation in 3300 ms returned []
Implicit Place search using SMT with State Equation took 4258 ms to find 0 implicit places.
// Phase 1: matrix 834 rows 922 cols
[2022-05-20 17:10:18] [INFO ] Computed 200 place invariants in 8 ms
[2022-05-20 17:10:19] [INFO ] Dead Transitions using invariants and state equation in 1057 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 922/922 places, 834/834 transitions.
Built C files in :
/tmp/ltsmin7367086994239974530
[2022-05-20 17:10:19] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7367086994239974530
Running compilation step : cd /tmp/ltsmin7367086994239974530;'/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 2774 ms.
Running link step : cd /tmp/ltsmin7367086994239974530;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin7367086994239974530;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16982793597020317999.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 17:10:34] [INFO ] Flatten gal took : 84 ms
[2022-05-20 17:10:34] [INFO ] Flatten gal took : 72 ms
[2022-05-20 17:10:34] [INFO ] Time to serialize gal into /tmp/LTL3711988117626656169.gal : 13 ms
[2022-05-20 17:10:34] [INFO ] Time to serialize properties into /tmp/LTL14388997551031697544.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/LTL3711988117626656169.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14388997551031697544.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/LTL3711988...267
Read 1 LTL properties
Checking formula 0 : !(((G("(p256==1)"))||(G(F(!((F(G("(((p140==1)&&(p978==1))&&(p1050==1))")))U("((p978==1)&&(p1050==1))")))))))
Formula 0 simplified : !(G"(p256==1)" | GF!(FG"(((p140==1)&&(p978==1))&&(p1050==1))" U "((p978==1)&&(p1050==1))"))
Detected timeout of ITS tools.
[2022-05-20 17:10:49] [INFO ] Flatten gal took : 72 ms
[2022-05-20 17:10:49] [INFO ] Applying decomposition
[2022-05-20 17:10:49] [INFO ] Flatten gal took : 74 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/graph12764947687281393740.txt' '-o' '/tmp/graph12764947687281393740.bin' '-w' '/tmp/graph12764947687281393740.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12764947687281393740.bin' '-l' '-1' '-v' '-w' '/tmp/graph12764947687281393740.weights' '-q' '0' '-e' '0.001'
[2022-05-20 17:10:49] [INFO ] Decomposing Gal with order
[2022-05-20 17:10:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 17:10:50] [INFO ] Removed a total of 1821 redundant transitions.
[2022-05-20 17:10:50] [INFO ] Flatten gal took : 122 ms
[2022-05-20 17:10:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 138 labels/synchronizations in 146 ms.
[2022-05-20 17:10:50] [INFO ] Time to serialize gal into /tmp/LTL1760918962318084742.gal : 10 ms
[2022-05-20 17:10:50] [INFO ] Time to serialize properties into /tmp/LTL6204086187875864732.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/LTL1760918962318084742.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6204086187875864732.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/LTL1760918...245
Read 1 LTL properties
Checking formula 0 : !(((G("(i6.u101.p256==1)"))||(G(F(!((F(G("(((i5.u70.p140==1)&&(i12.u324.p978==1))&&(i12.u324.p1050==1))")))U("((i12.u324.p978==1)&&(i1...180
Formula 0 simplified : !(G"(i6.u101.p256==1)" | GF!(FG"(((i5.u70.p140==1)&&(i12.u324.p978==1))&&(i12.u324.p1050==1))" U "((i12.u324.p978==1)&&(i12.u324.p10...165
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2418743864926427027
[2022-05-20 17:11:05] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2418743864926427027
Running compilation step : cd /tmp/ltsmin2418743864926427027;'/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 2461 ms.
Running link step : cd /tmp/ltsmin2418743864926427027;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin2418743864926427027;'/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' '([]((LTLAPp0==true))||[](<>(!(<>([]((LTLAPp1==true))) U (LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Parking-PT-864-LTLFireability-04 finished in 113720 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&G(F(G(p1)))))'
Support contains 3 out of 1037 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1037/1037 places, 939/939 transitions.
Applied a total of 0 rules in 30 ms. Remains 1037 /1037 variables (removed 0) and now considering 939/939 (removed 0) transitions.
// Phase 1: matrix 939 rows 1037 cols
[2022-05-20 17:11:20] [INFO ] Computed 202 place invariants in 3 ms
[2022-05-20 17:11:21] [INFO ] Implicit Places using invariants in 1070 ms returned [844]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1072 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1036/1037 places, 939/939 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1035 transition count 938
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1035 transition count 938
Applied a total of 2 rules in 86 ms. Remains 1035 /1036 variables (removed 1) and now considering 938/939 (removed 1) transitions.
// Phase 1: matrix 938 rows 1035 cols
[2022-05-20 17:11:21] [INFO ] Computed 201 place invariants in 3 ms
[2022-05-20 17:11:22] [INFO ] Implicit Places using invariants in 944 ms returned []
// Phase 1: matrix 938 rows 1035 cols
[2022-05-20 17:11:22] [INFO ] Computed 201 place invariants in 3 ms
[2022-05-20 17:11:23] [INFO ] State equation strengthened by 248 read => feed constraints.
[2022-05-20 17:11:25] [INFO ] Implicit Places using invariants and state equation in 2724 ms returned []
Implicit Place search using SMT with State Equation took 3670 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1035/1037 places, 938/939 transitions.
Finished structural reductions, in 2 iterations. Remains : 1035/1037 places, 938/939 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Parking-PT-864-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s260 1) (EQ s341 1)), p1:(EQ s118 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Parking-PT-864-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-05 finished in 5007 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(F(G(p0)))&&p1))||G(X(p2))))'
Support contains 3 out of 1037 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1037/1037 places, 939/939 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1036 transition count 938
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1036 transition count 938
Applied a total of 2 rules in 51 ms. Remains 1036 /1037 variables (removed 1) and now considering 938/939 (removed 1) transitions.
// Phase 1: matrix 938 rows 1036 cols
[2022-05-20 17:11:25] [INFO ] Computed 202 place invariants in 3 ms
[2022-05-20 17:11:26] [INFO ] Implicit Places using invariants in 801 ms returned [340, 843]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 803 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1034/1037 places, 938/939 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1033 transition count 937
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1033 transition count 937
Applied a total of 2 rules in 90 ms. Remains 1033 /1034 variables (removed 1) and now considering 937/938 (removed 1) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2022-05-20 17:11:26] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-20 17:11:27] [INFO ] Implicit Places using invariants in 978 ms returned []
// Phase 1: matrix 937 rows 1033 cols
[2022-05-20 17:11:27] [INFO ] Computed 200 place invariants in 4 ms
[2022-05-20 17:11:28] [INFO ] State equation strengthened by 248 read => feed constraints.
[2022-05-20 17:11:30] [INFO ] Implicit Places using invariants and state equation in 3109 ms returned []
Implicit Place search using SMT with State Equation took 4089 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1033/1037 places, 937/939 transitions.
Finished structural reductions, in 2 iterations. Remains : 1033/1037 places, 937/939 transitions.
Stuttering acceptance computed with spot in 352 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), true, (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Parking-PT-864-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 4}, { cond=(AND p1 p2), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 3}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s925 1), p2:(EQ s977 1), p0:(EQ s124 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 224 steps with 0 reset in 3 ms.
FORMULA Parking-PT-864-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-06 finished in 5532 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((G(p1)&&p0))||(F(p2)&&p3))))'
Support contains 7 out of 1037 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1037/1037 places, 939/939 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1036 transition count 938
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1036 transition count 938
Applied a total of 2 rules in 50 ms. Remains 1036 /1037 variables (removed 1) and now considering 938/939 (removed 1) transitions.
// Phase 1: matrix 938 rows 1036 cols
[2022-05-20 17:11:31] [INFO ] Computed 202 place invariants in 4 ms
[2022-05-20 17:11:32] [INFO ] Implicit Places using invariants in 1001 ms returned [340, 843]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1003 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1034/1037 places, 938/939 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1033 transition count 937
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1033 transition count 937
Applied a total of 2 rules in 51 ms. Remains 1033 /1034 variables (removed 1) and now considering 937/938 (removed 1) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2022-05-20 17:11:32] [INFO ] Computed 200 place invariants in 3 ms
[2022-05-20 17:11:33] [INFO ] Implicit Places using invariants in 838 ms returned []
// Phase 1: matrix 937 rows 1033 cols
[2022-05-20 17:11:33] [INFO ] Computed 200 place invariants in 5 ms
[2022-05-20 17:11:33] [INFO ] State equation strengthened by 248 read => feed constraints.
[2022-05-20 17:11:36] [INFO ] Implicit Places using invariants and state equation in 3185 ms returned []
Implicit Place search using SMT with State Equation took 4027 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1033/1037 places, 937/939 transitions.
Finished structural reductions, in 2 iterations. Remains : 1033/1037 places, 937/939 transitions.
Stuttering acceptance computed with spot in 453 ms :[true, (NOT p2), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : Parking-PT-864-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p3), acceptance={} source=3 dest: 5}, { cond=(AND p3 (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND p0 p1), acceptance={} source=5 dest: 4}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=7 dest: 7}]], initial=2, aps=[p2:(OR (EQ s50 0) (EQ s542 0)), p3:(EQ s535 0), p1:(AND (EQ s32 1) (EQ s425 1)), p0:(AND (EQ s134 1) (EQ s176 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, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 4922 ms.
Product exploration explored 100000 steps with 50000 reset in 4403 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 p2 p3 (NOT p1) (NOT p0)), (X p3), (X (NOT (AND p3 (NOT p2)))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p3 (NOT p2))))
Knowledge based reduction with 7 factoid took 130 ms. Reduced automaton from 8 states, 13 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA Parking-PT-864-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-864-LTLFireability-07 finished in 15079 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(p0))&&((F(p1) U p1)||p1))))'
Support contains 3 out of 1037 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1037/1037 places, 939/939 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1036 transition count 938
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1036 transition count 938
Applied a total of 2 rules in 51 ms. Remains 1036 /1037 variables (removed 1) and now considering 938/939 (removed 1) transitions.
// Phase 1: matrix 938 rows 1036 cols
[2022-05-20 17:11:46] [INFO ] Computed 202 place invariants in 2 ms
[2022-05-20 17:11:47] [INFO ] Implicit Places using invariants in 838 ms returned [340, 843]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 843 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1034/1037 places, 938/939 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1033 transition count 937
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1033 transition count 937
Applied a total of 2 rules in 51 ms. Remains 1033 /1034 variables (removed 1) and now considering 937/938 (removed 1) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2022-05-20 17:11:47] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-20 17:11:48] [INFO ] Implicit Places using invariants in 961 ms returned []
// Phase 1: matrix 937 rows 1033 cols
[2022-05-20 17:11:48] [INFO ] Computed 200 place invariants in 4 ms
[2022-05-20 17:11:48] [INFO ] State equation strengthened by 248 read => feed constraints.
[2022-05-20 17:11:51] [INFO ] Implicit Places using invariants and state equation in 3225 ms returned []
Implicit Place search using SMT with State Equation took 4189 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1033/1037 places, 937/939 transitions.
Finished structural reductions, in 2 iterations. Remains : 1033/1037 places, 937/939 transitions.
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Parking-PT-864-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(OR (EQ s954 0) (EQ s1032 0)), p1:(EQ s14 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1483 steps with 5 reset in 29 ms.
FORMULA Parking-PT-864-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-08 finished in 5375 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(G((F((X(p1)&&G(p1)))&&X(p2)&&p0))))))'
Support contains 3 out of 1037 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1037/1037 places, 939/939 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1036 transition count 938
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1036 transition count 938
Applied a total of 2 rules in 85 ms. Remains 1036 /1037 variables (removed 1) and now considering 938/939 (removed 1) transitions.
// Phase 1: matrix 938 rows 1036 cols
[2022-05-20 17:11:51] [INFO ] Computed 202 place invariants in 2 ms
[2022-05-20 17:11:52] [INFO ] Implicit Places using invariants in 997 ms returned [340, 843]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1008 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1034/1037 places, 938/939 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1033 transition count 937
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1033 transition count 937
Applied a total of 2 rules in 92 ms. Remains 1033 /1034 variables (removed 1) and now considering 937/938 (removed 1) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2022-05-20 17:11:52] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-20 17:11:53] [INFO ] Implicit Places using invariants in 975 ms returned []
// Phase 1: matrix 937 rows 1033 cols
[2022-05-20 17:11:53] [INFO ] Computed 200 place invariants in 7 ms
[2022-05-20 17:11:54] [INFO ] State equation strengthened by 248 read => feed constraints.
[2022-05-20 17:11:56] [INFO ] Implicit Places using invariants and state equation in 2988 ms returned []
Implicit Place search using SMT with State Equation took 3970 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1033/1037 places, 937/939 transitions.
Finished structural reductions, in 2 iterations. Remains : 1033/1037 places, 937/939 transitions.
Stuttering acceptance computed with spot in 369 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), true, (OR (AND p0 (NOT p2)) (AND (NOT p1) p2)), (NOT p1)]
Running random walk in product with property : Parking-PT-864-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 5}], [{ cond=p1, acceptance={} source=5 dest: 5}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s936 1) (EQ s980 1)), p2:(EQ s627 1), p1:(AND (EQ s936 1) (EQ s980 1))], nbAcceptance=1, 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Parking-PT-864-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-10 finished in 5563 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 1037 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1037/1037 places, 939/939 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1037 transition count 907
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1005 transition count 907
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 64 place count 1005 transition count 875
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 128 place count 973 transition count 875
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 129 place count 972 transition count 874
Iterating global reduction 2 with 1 rules applied. Total rules applied 130 place count 972 transition count 874
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 226 place count 924 transition count 826
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
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 228 place count 923 transition count 833
Applied a total of 228 rules in 245 ms. Remains 923 /1037 variables (removed 114) and now considering 833/939 (removed 106) transitions.
// Phase 1: matrix 833 rows 923 cols
[2022-05-20 17:11:57] [INFO ] Computed 202 place invariants in 3 ms
[2022-05-20 17:11:58] [INFO ] Implicit Places using invariants in 1092 ms returned [313, 757]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1094 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 921/1037 places, 833/939 transitions.
Applied a total of 0 rules in 39 ms. Remains 921 /921 variables (removed 0) and now considering 833/833 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 921/1037 places, 833/939 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-864-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s84 1) (EQ s692 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 223 steps with 0 reset in 2 ms.
FORMULA Parking-PT-864-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-11 finished in 1433 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U p1)&&X(X((X(p2)||p3)))))'
Support contains 5 out of 1037 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1037/1037 places, 939/939 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1036 transition count 938
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1036 transition count 938
Applied a total of 2 rules in 53 ms. Remains 1036 /1037 variables (removed 1) and now considering 938/939 (removed 1) transitions.
// Phase 1: matrix 938 rows 1036 cols
[2022-05-20 17:11:58] [INFO ] Computed 202 place invariants in 2 ms
[2022-05-20 17:11:59] [INFO ] Implicit Places using invariants in 832 ms returned [340, 843]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 844 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1034/1037 places, 938/939 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1033 transition count 937
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1033 transition count 937
Applied a total of 2 rules in 73 ms. Remains 1033 /1034 variables (removed 1) and now considering 937/938 (removed 1) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2022-05-20 17:11:59] [INFO ] Computed 200 place invariants in 4 ms
[2022-05-20 17:12:00] [INFO ] Implicit Places using invariants in 1013 ms returned []
// Phase 1: matrix 937 rows 1033 cols
[2022-05-20 17:12:00] [INFO ] Computed 200 place invariants in 3 ms
[2022-05-20 17:12:01] [INFO ] State equation strengthened by 248 read => feed constraints.
[2022-05-20 17:12:04] [INFO ] Implicit Places using invariants and state equation in 3521 ms returned []
Implicit Place search using SMT with State Equation took 4549 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1033/1037 places, 937/939 transitions.
Finished structural reductions, in 2 iterations. Remains : 1033/1037 places, 937/939 transitions.
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (NOT p2)]
Running random walk in product with property : Parking-PT-864-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(OR p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p3), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 1}]], initial=0, aps=[p1:(EQ s753 1), p0:(AND (EQ s808 1) (EQ s843 1)), p3:(EQ s753 0), p2:(OR (EQ s701 0) (EQ s739 0))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 454 steps with 1 reset in 10 ms.
FORMULA Parking-PT-864-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-13 finished in 5795 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(F(!(F(G(p1)) U p2)))))'
[2022-05-20 17:12:04] [INFO ] Flatten gal took : 61 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10680809046261529002
[2022-05-20 17:12:04] [INFO ] Computing symmetric may disable matrix : 939 transitions.
[2022-05-20 17:12:04] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 17:12:04] [INFO ] Computing symmetric may enable matrix : 939 transitions.
[2022-05-20 17:12:04] [INFO ] Applying decomposition
[2022-05-20 17:12:04] [INFO ] Computation of Complete enable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 17:12:04] [INFO ] Flatten gal took : 85 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/graph1100665149400019989.txt' '-o' '/tmp/graph1100665149400019989.bin' '-w' '/tmp/graph1100665149400019989.weights'
[2022-05-20 17:12:04] [INFO ] Computing Do-Not-Accords matrix : 939 transitions.
[2022-05-20 17:12:04] [INFO ] Computation of Completed DNA matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1100665149400019989.bin' '-l' '-1' '-v' '-w' '/tmp/graph1100665149400019989.weights' '-q' '0' '-e' '0.001'
[2022-05-20 17:12:04] [INFO ] Built C files in 340ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10680809046261529002
Running compilation step : cd /tmp/ltsmin10680809046261529002;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' '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 17:12:04] [INFO ] Decomposing Gal with order
[2022-05-20 17:12:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 17:12:05] [INFO ] Removed a total of 114 redundant transitions.
[2022-05-20 17:12:05] [INFO ] Flatten gal took : 126 ms
[2022-05-20 17:12:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2022-05-20 17:12:05] [INFO ] Time to serialize gal into /tmp/LTLFireability13796834001770877525.gal : 14 ms
[2022-05-20 17:12:05] [INFO ] Time to serialize properties into /tmp/LTLFireability6302519751939324596.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/LTLFireability13796834001770877525.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6302519751939324596.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 1 LTL properties
Checking formula 0 : !(((G("(i6.u99.p256==1)"))||(G(F(!((F(G("(((i5.u69.p140==1)&&(i12.i1.i1.u313.p978==1))&&(i12.i1.i1.u331.p1050==1))")))U("((i12.i1.i1.u...203
Formula 0 simplified : !(G"(i6.u99.p256==1)" | GF!(FG"(((i5.u69.p140==1)&&(i12.i1.i1.u313.p978==1))&&(i12.i1.i1.u331.p1050==1))" U "((i12.i1.i1.u313.p978==...188
Compilation finished in 4564 ms.
Running link step : cd /tmp/ltsmin10680809046261529002;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 71 ms.
Running LTSmin : cd /tmp/ltsmin10680809046261529002;'/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' '([]((LTLAPp0==true))||[](<>(!(<>([]((LTLAPp1==true))) U (LTLAPp2==true)))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions i5.u94.t240, i6.u134.t206, i7.u175.t172, i9.u212.t138, i10.u251.t104, i11.u290.t70, i12.i1.i1...278
Computing Next relation with stutter on 5.35201e+12 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
2697 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,27.2991,596076,1,0,1.27906e+06,11072,14744,2.50753e+06,1092,47251,1527628
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-864-LTLFireability-04 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 317538 ms.

BK_STOP 1653066791585

--------------------
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//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ 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-864"
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-864, 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-165276998700340"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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