Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r285-smll-171654421900063.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
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 r285-smll-171654421900063
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 884K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 20:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 11 20:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 11 19:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 11 19:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 427K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Parking-PT-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 1716844593314

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-864
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-27 21:16:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-27 21:16:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 21:16:37] [INFO ] Load time of PNML (sax parser for PT used): 317 ms
[2024-05-27 21:16:37] [INFO ] Transformed 1185 places.
[2024-05-27 21:16:37] [INFO ] Transformed 1697 transitions.
[2024-05-27 21:16:37] [INFO ] Found NUPN structural information;
[2024-05-27 21:16:37] [INFO ] Parsed PT model containing 1185 places and 1697 transitions and 5073 arcs in 501 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 688 transitions
Reduce redundant transitions removed 688 transitions.
FORMULA Parking-PT-864-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 1185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1185/1185 places, 1009/1009 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1178 transition count 1002
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1178 transition count 1002
Applied a total of 14 rules in 246 ms. Remains 1178 /1185 variables (removed 7) and now considering 1002/1009 (removed 7) transitions.
// Phase 1: matrix 1002 rows 1178 cols
[2024-05-27 21:16:38] [INFO ] Computed 280 invariants in 78 ms
[2024-05-27 21:16:40] [INFO ] Implicit Places using invariants in 2008 ms returned []
[2024-05-27 21:16:40] [INFO ] Invariant cache hit.
[2024-05-27 21:16:41] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-27 21:16:45] [INFO ] Implicit Places using invariants and state equation in 5178 ms returned [152, 160, 168, 176, 184, 192, 200, 240, 242, 285, 301, 309, 317, 325, 333, 341, 373, 375, 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, 950, 958, 966, 974, 982, 990, 998, 1006, 1038, 1040, 1084, 1092, 1100, 1108, 1116, 1124, 1132, 1140, 1174]
Discarding 77 places :
Implicit Place search using SMT with State Equation took 7270 ms to find 77 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1101/1185 places, 1002/1009 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 1040 transition count 941
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 1040 transition count 941
Applied a total of 122 rules in 726 ms. Remains 1040 /1101 variables (removed 61) and now considering 941/1002 (removed 61) transitions.
// Phase 1: matrix 941 rows 1040 cols
[2024-05-27 21:16:45] [INFO ] Computed 203 invariants in 16 ms
[2024-05-27 21:16:47] [INFO ] Implicit Places using invariants in 1155 ms returned []
[2024-05-27 21:16:47] [INFO ] Invariant cache hit.
[2024-05-27 21:16:48] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-27 21:16:50] [INFO ] Implicit Places using invariants and state equation in 3397 ms returned []
Implicit Place search using SMT with State Equation took 4555 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1040/1185 places, 941/1009 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 12797 ms. Remains : 1040/1185 places, 941/1009 transitions.
Support contains 51 out of 1040 places after structural reductions.
[2024-05-27 21:16:50] [INFO ] Flatten gal took : 195 ms
[2024-05-27 21:16:51] [INFO ] Flatten gal took : 158 ms
[2024-05-27 21:16:51] [INFO ] Input system was already deterministic with 941 transitions.
Support contains 49 out of 1040 places (down from 51) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 39 resets, run finished after 1034 ms. (steps per millisecond=9 ) properties (out of 35) seen :25
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 10) 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 10) 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 10) 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 10) 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 10) 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 10) 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 10) seen :0
Running SMT prover for 10 properties.
[2024-05-27 21:16:53] [INFO ] Invariant cache hit.
[2024-05-27 21:16:53] [INFO ] After 563ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-27 21:16:54] [INFO ] [Nat]Absence check using 203 positive place invariants in 108 ms returned sat
[2024-05-27 21:16:56] [INFO ] After 1714ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2024-05-27 21:16:56] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-27 21:16:57] [INFO ] After 1425ms SMT Verify possible using 248 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2024-05-27 21:16:58] [INFO ] Deduced a trap composed of 67 places in 98 ms of which 7 ms to minimize.
[2024-05-27 21:16:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 264 ms
[2024-05-27 21:16:59] [INFO ] Deduced a trap composed of 68 places in 88 ms of which 2 ms to minimize.
[2024-05-27 21:16:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 239 ms
[2024-05-27 21:16:59] [INFO ] After 3553ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 1046 ms.
[2024-05-27 21:17:00] [INFO ] After 7324ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 9 properties in 271 ms.
Support contains 4 out of 1040 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1040/1040 places, 941/941 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 1040 transition count 909
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1008 transition count 909
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 1008 transition count 877
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 976 transition count 877
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 129 place count 975 transition count 876
Iterating global reduction 2 with 1 rules applied. Total rules applied 130 place count 975 transition count 876
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 2 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 228 place count 926 transition count 827
Free-agglomeration rule applied 252 times.
Iterating global reduction 2 with 252 rules applied. Total rules applied 480 place count 926 transition count 575
Reduce places removed 252 places and 0 transitions.
Graph (complete) has 1347 edges and 674 vertex of which 192 are kept as prefixes of interest. Removing 482 places using SCC suffix rule.3 ms
Discarding 482 places :
Also discarding 397 output transitions
Drop transitions removed 397 transitions
Iterating post reduction 2 with 253 rules applied. Total rules applied 733 place count 192 transition count 178
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 757 place count 192 transition count 154
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 758 place count 192 transition count 153
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 759 place count 191 transition count 153
Applied a total of 759 rules in 515 ms. Remains 191 /1040 variables (removed 849) and now considering 153/941 (removed 788) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 516 ms. Remains : 191/1040 places, 153/941 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 1) seen :0
Finished Best-First random walk after 585 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=195 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||(!p1&&X((!p1 U (X(!p2)||G(!p1))))))))'
Support contains 6 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1039 transition count 940
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1039 transition count 940
Applied a total of 2 rules in 109 ms. Remains 1039 /1040 variables (removed 1) and now considering 940/941 (removed 1) transitions.
// Phase 1: matrix 940 rows 1039 cols
[2024-05-27 21:17:02] [INFO ] Computed 203 invariants in 11 ms
[2024-05-27 21:17:03] [INFO ] Implicit Places using invariants in 1128 ms returned [195, 276, 1034]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1136 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1036/1040 places, 940/941 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1033 transition count 937
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1033 transition count 937
Applied a total of 6 rules in 76 ms. Remains 1033 /1036 variables (removed 3) and now considering 937/940 (removed 3) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2024-05-27 21:17:03] [INFO ] Computed 200 invariants in 8 ms
[2024-05-27 21:17:04] [INFO ] Implicit Places using invariants in 1030 ms returned []
[2024-05-27 21:17:04] [INFO ] Invariant cache hit.
[2024-05-27 21:17:05] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-27 21:17:08] [INFO ] Implicit Places using invariants and state equation in 3493 ms returned []
Implicit Place search using SMT with State Equation took 4526 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1033/1040 places, 937/941 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5848 ms. Remains : 1033/1040 places, 937/941 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 593 ms :[true, (NOT p0), (OR (NOT p0) p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2))]
Running random walk in product with property : Parking-PT-864-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}], [{ cond=(OR (NOT p0) p2), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 p0), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(OR (AND p1 (NOT p0)) (AND p1 p2)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) p2)), acceptance={} source=5 dest: 5}]], initial=3, aps=[p0:(OR (EQ s356 0) (EQ s394 0)), p1:(AND (EQ s130 1) (EQ s171 1)), p2:(AND (EQ s361 1) (EQ s405 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 388 reset in 1922 ms.
Product exploration explored 100000 steps with 389 reset in 1822 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 p0 (NOT p1) (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) p0 (NOT p2)))), true, (X (X (NOT (AND p1 p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (OR (NOT p0) p2)))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p1 p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 290 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 353 ms :[true, (NOT p0), (OR (NOT p0) p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2))]
Incomplete random walk after 10000 steps, including 39 resets, run finished after 563 ms. (steps per millisecond=17 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) 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 7) seen :0
Running SMT prover for 7 properties.
[2024-05-27 21:17:14] [INFO ] Invariant cache hit.
[2024-05-27 21:17:14] [INFO ] After 405ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-27 21:17:15] [INFO ] [Nat]Absence check using 200 positive place invariants in 88 ms returned sat
[2024-05-27 21:17:16] [INFO ] After 1158ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-27 21:17:16] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-27 21:17:17] [INFO ] After 892ms SMT Verify possible using 248 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2024-05-27 21:17:18] [INFO ] After 1959ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 985 ms.
[2024-05-27 21:17:19] [INFO ] After 4875ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 5 different solutions.
Finished Parikh walk after 203 steps, including 0 resets, run visited all 2 properties in 13 ms. (steps per millisecond=15 )
Parikh walk visited 7 properties in 128 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) p0 (NOT p2)))), true, (X (X (NOT (AND p1 p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (OR (NOT p0) p2)))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p1 p2)))))]
False Knowledge obtained : [(F (AND p1 p0 (NOT p2))), (F (OR (NOT p0) p2)), (F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) p0 (NOT p2)))), (F (NOT p0)), (F (NOT (AND (NOT p1) p0))), (F (AND p1 p0)), (F (OR (AND p1 (NOT p0)) (AND p1 p2))), (F (AND (NOT p1) (NOT p0))), (F (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) p2)))]
Knowledge based reduction with 17 factoid took 1276 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 356 ms :[true, (NOT p0), (OR (NOT p0) p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2))]
Stuttering acceptance computed with spot in 351 ms :[true, (NOT p0), (OR (NOT p0) p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2))]
Support contains 6 out of 1033 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1033/1033 places, 937/937 transitions.
Applied a total of 0 rules in 45 ms. Remains 1033 /1033 variables (removed 0) and now considering 937/937 (removed 0) transitions.
[2024-05-27 21:17:22] [INFO ] Invariant cache hit.
[2024-05-27 21:17:23] [INFO ] Implicit Places using invariants in 1272 ms returned []
[2024-05-27 21:17:23] [INFO ] Invariant cache hit.
[2024-05-27 21:17:24] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-27 21:17:26] [INFO ] Implicit Places using invariants and state equation in 3154 ms returned []
Implicit Place search using SMT with State Equation took 4430 ms to find 0 implicit places.
[2024-05-27 21:17:26] [INFO ] Invariant cache hit.
[2024-05-27 21:17:27] [INFO ] Dead Transitions using invariants and state equation in 1028 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5506 ms. Remains : 1033/1033 places, 937/937 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (OR (NOT p0) p2)))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p1 p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 245 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[true, (NOT p0), (OR (NOT p0) p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2))]
Incomplete random walk after 10000 steps, including 39 resets, run finished after 517 ms. (steps per millisecond=19 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 7) 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 7) seen :0
Running SMT prover for 7 properties.
[2024-05-27 21:17:28] [INFO ] Invariant cache hit.
[2024-05-27 21:17:29] [INFO ] After 385ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-27 21:17:29] [INFO ] [Nat]Absence check using 200 positive place invariants in 97 ms returned sat
[2024-05-27 21:17:31] [INFO ] After 1302ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-27 21:17:31] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-27 21:17:32] [INFO ] After 703ms SMT Verify possible using 248 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2024-05-27 21:17:33] [INFO ] After 1823ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 744 ms.
[2024-05-27 21:17:33] [INFO ] After 4596ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 5 properties in 197 ms.
Support contains 6 out of 1033 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1033/1033 places, 937/937 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 1033 transition count 905
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1001 transition count 905
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 1001 transition count 873
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 969 transition count 873
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 222 place count 922 transition count 826
Free-agglomeration rule applied 260 times.
Iterating global reduction 2 with 260 rules applied. Total rules applied 482 place count 922 transition count 566
Reduce places removed 260 places and 0 transitions.
Graph (complete) has 1330 edges and 662 vertex of which 182 are kept as prefixes of interest. Removing 480 places using SCC suffix rule.1 ms
Discarding 480 places :
Also discarding 396 output transitions
Drop transitions removed 396 transitions
Iterating post reduction 2 with 261 rules applied. Total rules applied 743 place count 182 transition count 170
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 767 place count 182 transition count 146
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 768 place count 182 transition count 146
Applied a total of 768 rules in 244 ms. Remains 182 /1033 variables (removed 851) and now considering 146/937 (removed 791) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 244 ms. Remains : 182/1033 places, 146/937 transitions.
Incomplete random walk after 10000 steps, including 101 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 2) seen :0
Finished Best-First random walk after 5706 steps, including 7 resets, run visited all 2 properties in 17 ms. (steps per millisecond=335 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (OR (NOT p0) p2)))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p1 p2)))))]
False Knowledge obtained : [(F (AND p0 p1 (NOT p2))), (F (OR (NOT p0) p2)), (F (AND (NOT p0) p1)), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (AND p0 p1)), (F (OR (AND (NOT p0) p1) (AND p1 p2))), (F (AND (NOT p0) (NOT p1))), (F (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)))]
Knowledge based reduction with 15 factoid took 893 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 314 ms :[true, (NOT p0), (OR (NOT p0) p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2))]
Stuttering acceptance computed with spot in 311 ms :[true, (NOT p0), (OR (NOT p0) p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2))]
Stuttering acceptance computed with spot in 309 ms :[true, (NOT p0), (OR (NOT p0) p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2))]
Product exploration explored 100000 steps with 392 reset in 1777 ms.
Product exploration explored 100000 steps with 387 reset in 1570 ms.
Built C files in :
/tmp/ltsmin18129040547198327728
[2024-05-27 21:17:40] [INFO ] Built C files in 94ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18129040547198327728
Running compilation step : cd /tmp/ltsmin18129040547198327728;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin18129040547198327728;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin18129040547198327728;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 6 out of 1033 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1033/1033 places, 937/937 transitions.
Applied a total of 0 rules in 37 ms. Remains 1033 /1033 variables (removed 0) and now considering 937/937 (removed 0) transitions.
[2024-05-27 21:17:43] [INFO ] Invariant cache hit.
[2024-05-27 21:17:44] [INFO ] Implicit Places using invariants in 989 ms returned []
[2024-05-27 21:17:44] [INFO ] Invariant cache hit.
[2024-05-27 21:17:45] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-27 21:17:47] [INFO ] Implicit Places using invariants and state equation in 2936 ms returned []
Implicit Place search using SMT with State Equation took 3928 ms to find 0 implicit places.
[2024-05-27 21:17:47] [INFO ] Invariant cache hit.
[2024-05-27 21:17:48] [INFO ] Dead Transitions using invariants and state equation in 980 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4960 ms. Remains : 1033/1033 places, 937/937 transitions.
Built C files in :
/tmp/ltsmin3254067688219388908
[2024-05-27 21:17:48] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3254067688219388908
Running compilation step : cd /tmp/ltsmin3254067688219388908;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2881 ms.
Running link step : cd /tmp/ltsmin3254067688219388908;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 80 ms.
Running LTSmin : cd /tmp/ltsmin3254067688219388908;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15351642990061102970.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 21:18:03] [INFO ] Flatten gal took : 76 ms
[2024-05-27 21:18:03] [INFO ] Flatten gal took : 94 ms
[2024-05-27 21:18:03] [INFO ] Time to serialize gal into /tmp/LTL462289929352960628.gal : 29 ms
[2024-05-27 21:18:03] [INFO ] Time to serialize properties into /tmp/LTL645263182300557989.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL462289929352960628.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9269860904161936216.hoa' '-atoms' '/tmp/LTL645263182300557989.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...315
Loading property file /tmp/LTL645263182300557989.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9269860904161936216.hoa
Detected timeout of ITS tools.
[2024-05-27 21:18:18] [INFO ] Flatten gal took : 45 ms
[2024-05-27 21:18:18] [INFO ] Flatten gal took : 41 ms
[2024-05-27 21:18:18] [INFO ] Time to serialize gal into /tmp/LTL17936814148166170647.gal : 6 ms
[2024-05-27 21:18:18] [INFO ] Time to serialize properties into /tmp/LTL430310033124494290.ltl : 14 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17936814148166170647.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL430310033124494290.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((X("((p394==0)||(p438==0))"))||((X((!("((p130==1)&&(p179==1))"))U((X(!("((p399==1)&&(p451==1))")))||(G(!("((p130==1)&&(p179==1))"...193
Formula 0 simplified : F(X!"((p394==0)||(p438==0))" & (!"((p130!=1)||(p179!=1))" | X("((p130==1)&&(p179==1))" M X"((p399==1)&&(p451==1))")))
Detected timeout of ITS tools.
[2024-05-27 21:18:34] [INFO ] Flatten gal took : 38 ms
[2024-05-27 21:18:34] [INFO ] Applying decomposition
[2024-05-27 21:18:34] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11359685928766347448.txt' '-o' '/tmp/graph11359685928766347448.bin' '-w' '/tmp/graph11359685928766347448.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11359685928766347448.bin' '-l' '-1' '-v' '-w' '/tmp/graph11359685928766347448.weights' '-q' '0' '-e' '0.001'
[2024-05-27 21:18:34] [INFO ] Decomposing Gal with order
[2024-05-27 21:18:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 21:18:34] [INFO ] Removed a total of 118 redundant transitions.
[2024-05-27 21:18:34] [INFO ] Flatten gal took : 222 ms
[2024-05-27 21:18:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 40 ms.
[2024-05-27 21:18:35] [INFO ] Time to serialize gal into /tmp/LTL10510300974278776650.gal : 34 ms
[2024-05-27 21:18:35] [INFO ] Time to serialize properties into /tmp/LTL5220635612060576017.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10510300974278776650.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5220635612060576017.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((X("((i5.i0.i1.u142.p394==0)||(i5.i0.i0.u152.p438==0))"))||((X((!("((i0.u64.p130==1)&&(i0.u76.p179==1))"))U((X(!("((i5.i1.i2.u145...291
Formula 0 simplified : F(X!"((i5.i0.i1.u142.p394==0)||(i5.i0.i0.u152.p438==0))" & (!"((i0.u64.p130!=1)||(i0.u76.p179!=1))" | X("((i0.u64.p130==1)&&(i0.u76....224
Reverse transition relation is NOT exact ! Due to transitions i0.u94.t241, i3.u135.t207, i5.i0.i0.u175.t173, i6.u215.t139, i9.i1.i1.u254.t105, i11.u294.t71...283
Computing Next relation with stutter on 5.35201e+12 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16242495111944679191
[2024-05-27 21:18:50] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16242495111944679191
Running compilation step : cd /tmp/ltsmin16242495111944679191;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2729 ms.
Running link step : cd /tmp/ltsmin16242495111944679191;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin16242495111944679191;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X((LTLAPp0==true))||(X((!(LTLAPp1==true) U (X(!(LTLAPp2==true))||[](!(LTLAPp1==true)))))&&!(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Parking-PT-864-LTLFireability-00 finished in 122751 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1039 transition count 940
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1039 transition count 940
Applied a total of 2 rules in 59 ms. Remains 1039 /1040 variables (removed 1) and now considering 940/941 (removed 1) transitions.
// Phase 1: matrix 940 rows 1039 cols
[2024-05-27 21:19:05] [INFO ] Computed 203 invariants in 5 ms
[2024-05-27 21:19:06] [INFO ] Implicit Places using invariants in 809 ms returned [195, 276, 1034]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 811 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1036/1040 places, 940/941 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1033 transition count 937
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1033 transition count 937
Applied a total of 6 rules in 76 ms. Remains 1033 /1036 variables (removed 3) and now considering 937/940 (removed 3) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2024-05-27 21:19:06] [INFO ] Computed 200 invariants in 4 ms
[2024-05-27 21:19:07] [INFO ] Implicit Places using invariants in 897 ms returned []
[2024-05-27 21:19:07] [INFO ] Invariant cache hit.
[2024-05-27 21:19:07] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-27 21:19:10] [INFO ] Implicit Places using invariants and state equation in 3237 ms returned []
Implicit Place search using SMT with State Equation took 4137 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1033/1040 places, 937/941 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5084 ms. Remains : 1033/1040 places, 937/941 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-864-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s995 1) (EQ s874 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 247 steps with 0 reset in 3 ms.
FORMULA Parking-PT-864-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-01 finished in 5213 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X(X(G(p1))))&&p0))))'
Support contains 2 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1039 transition count 940
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1039 transition count 940
Applied a total of 2 rules in 82 ms. Remains 1039 /1040 variables (removed 1) and now considering 940/941 (removed 1) transitions.
// Phase 1: matrix 940 rows 1039 cols
[2024-05-27 21:19:10] [INFO ] Computed 203 invariants in 6 ms
[2024-05-27 21:19:11] [INFO ] Implicit Places using invariants in 1261 ms returned [195, 276, 1034]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1263 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1036/1040 places, 940/941 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1033 transition count 937
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1033 transition count 937
Applied a total of 6 rules in 87 ms. Remains 1033 /1036 variables (removed 3) and now considering 937/940 (removed 3) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2024-05-27 21:19:11] [INFO ] Computed 200 invariants in 8 ms
[2024-05-27 21:19:12] [INFO ] Implicit Places using invariants in 1048 ms returned []
[2024-05-27 21:19:12] [INFO ] Invariant cache hit.
[2024-05-27 21:19:13] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-27 21:19:16] [INFO ] Implicit Places using invariants and state equation in 3304 ms returned []
Implicit Place search using SMT with State Equation took 4363 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1033/1040 places, 937/941 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5798 ms. Remains : 1033/1040 places, 937/941 transitions.
Stuttering acceptance computed with spot in 276 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-864-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 2}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 3}]], initial=1, aps=[p0:(AND (EQ s270 1) (EQ s342 1)), p1:(AND (EQ s270 1) (EQ s342 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Parking-PT-864-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-02 finished in 6097 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 2 out of 1040 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1040/1040 places, 941/941 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 1040 transition count 910
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 1009 transition count 910
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 1009 transition count 879
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 978 transition count 879
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 125 place count 977 transition count 878
Iterating global reduction 2 with 1 rules applied. Total rules applied 126 place count 977 transition count 878
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 228 place count 926 transition count 827
Applied a total of 228 rules in 229 ms. Remains 926 /1040 variables (removed 114) and now considering 827/941 (removed 114) transitions.
// Phase 1: matrix 827 rows 926 cols
[2024-05-27 21:19:16] [INFO ] Computed 203 invariants in 5 ms
[2024-05-27 21:19:17] [INFO ] Implicit Places using invariants in 1081 ms returned [181, 257, 922]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1093 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 923/1040 places, 827/941 transitions.
Applied a total of 0 rules in 59 ms. Remains 923 /923 variables (removed 0) and now considering 827/827 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1382 ms. Remains : 923/1040 places, 827/941 transitions.
Stuttering acceptance computed with spot in 110 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:(EQ s258 1), p1:(EQ s239 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 233 steps with 1 reset in 6 ms.
FORMULA Parking-PT-864-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-03 finished in 1526 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)||(p1&&F((!p2&&X(p3))))))))'
Support contains 3 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1039 transition count 940
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1039 transition count 940
Applied a total of 2 rules in 88 ms. Remains 1039 /1040 variables (removed 1) and now considering 940/941 (removed 1) transitions.
// Phase 1: matrix 940 rows 1039 cols
[2024-05-27 21:19:18] [INFO ] Computed 203 invariants in 6 ms
[2024-05-27 21:19:19] [INFO ] Implicit Places using invariants in 1150 ms returned [276, 1034]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1156 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1037/1040 places, 940/941 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1035 transition count 938
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1035 transition count 938
Applied a total of 4 rules in 84 ms. Remains 1035 /1037 variables (removed 2) and now considering 938/940 (removed 2) transitions.
// Phase 1: matrix 938 rows 1035 cols
[2024-05-27 21:19:19] [INFO ] Computed 201 invariants in 4 ms
[2024-05-27 21:19:20] [INFO ] Implicit Places using invariants in 1242 ms returned []
[2024-05-27 21:19:20] [INFO ] Invariant cache hit.
[2024-05-27 21:19:21] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-27 21:19:24] [INFO ] Implicit Places using invariants and state equation in 3454 ms returned []
Implicit Place search using SMT with State Equation took 4707 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1035/1040 places, 938/941 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6037 ms. Remains : 1035/1040 places, 938/941 transitions.
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-864-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1 p2 (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2 (NOT p3)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(EQ s967 0), p1:(NEQ s967 1), p2:(OR (AND (EQ s195 1) (EQ s226 1)) (EQ s967 1)), p3:(AND (EQ s195 1) (EQ s226 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 5397 ms.
Product exploration explored 100000 steps with 50000 reset in 4789 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 p0 p1 (NOT p2) (NOT p3)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 163 ms. Reduced automaton from 4 states, 12 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Parking-PT-864-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-864-LTLFireability-04 finished in 16670 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(X((X(X(G(X(G(p0))))) U p1))))))'
Support contains 3 out of 1040 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1040/1040 places, 941/941 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 1040 transition count 910
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 1009 transition count 910
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 1009 transition count 879
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 124 place count 978 transition count 879
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 125 place count 977 transition count 878
Iterating global reduction 2 with 1 rules applied. Total rules applied 126 place count 977 transition count 878
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 228 place count 926 transition count 827
Applied a total of 228 rules in 195 ms. Remains 926 /1040 variables (removed 114) and now considering 827/941 (removed 114) transitions.
// Phase 1: matrix 827 rows 926 cols
[2024-05-27 21:19:34] [INFO ] Computed 203 invariants in 5 ms
[2024-05-27 21:19:36] [INFO ] Implicit Places using invariants in 1128 ms returned [181, 257, 922]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1130 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 923/1040 places, 827/941 transitions.
Applied a total of 0 rules in 51 ms. Remains 923 /923 variables (removed 0) and now considering 827/827 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1378 ms. Remains : 923/1040 places, 827/941 transitions.
Stuttering acceptance computed with spot in 250 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Parking-PT-864-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={1} source=0 dest: 0}, { cond=(NOT p1), acceptance={0, 1} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0, 1} source=1 dest: 1}, { cond=true, acceptance={1} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0, 1} source=2 dest: 3}, { cond=true, acceptance={1} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 1}, { cond=(NOT p0), acceptance={1} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={1} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=5 dest: 3}, { cond=p0, acceptance={} source=5 dest: 4}, { cond=(NOT p0), acceptance={1} source=5 dest: 4}]], initial=0, aps=[p1:(AND (EQ s427 1) (EQ s460 1)), p0:(EQ s363 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 285 steps with 0 reset in 6 ms.
FORMULA Parking-PT-864-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-05 finished in 1670 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1040 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1040/1040 places, 941/941 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 1040 transition count 909
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1008 transition count 909
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 1008 transition count 877
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 976 transition count 877
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 129 place count 975 transition count 876
Iterating global reduction 2 with 1 rules applied. Total rules applied 130 place count 975 transition count 876
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 232 place count 924 transition count 825
Applied a total of 232 rules in 176 ms. Remains 924 /1040 variables (removed 116) and now considering 825/941 (removed 116) transitions.
// Phase 1: matrix 825 rows 924 cols
[2024-05-27 21:19:36] [INFO ] Computed 203 invariants in 5 ms
[2024-05-27 21:19:37] [INFO ] Implicit Places using invariants in 966 ms returned [181, 257, 920]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 970 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 921/1040 places, 825/941 transitions.
Applied a total of 0 rules in 47 ms. Remains 921 /921 variables (removed 0) and now considering 825/825 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1196 ms. Remains : 921/1040 places, 825/941 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-864-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s241 1) (EQ s520 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 232 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 1339 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U p1)||(p1 U p2)))'
Support contains 4 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1039 transition count 940
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1039 transition count 940
Applied a total of 2 rules in 47 ms. Remains 1039 /1040 variables (removed 1) and now considering 940/941 (removed 1) transitions.
// Phase 1: matrix 940 rows 1039 cols
[2024-05-27 21:19:37] [INFO ] Computed 203 invariants in 10 ms
[2024-05-27 21:19:39] [INFO ] Implicit Places using invariants in 1235 ms returned [195, 276, 1034]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1238 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1036/1040 places, 940/941 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1033 transition count 937
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1033 transition count 937
Applied a total of 6 rules in 79 ms. Remains 1033 /1036 variables (removed 3) and now considering 937/940 (removed 3) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2024-05-27 21:19:39] [INFO ] Computed 200 invariants in 3 ms
[2024-05-27 21:19:40] [INFO ] Implicit Places using invariants in 1132 ms returned []
[2024-05-27 21:19:40] [INFO ] Invariant cache hit.
[2024-05-27 21:19:41] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-27 21:19:43] [INFO ] Implicit Places using invariants and state equation in 3318 ms returned []
Implicit Place search using SMT with State Equation took 4458 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1033/1040 places, 937/941 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5824 ms. Remains : 1033/1040 places, 937/941 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, (AND (NOT p1) (NOT p2)), (OR (NOT p0) (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=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s644 1), p2:(AND (EQ s289 1) (EQ s341 1)), p0:(EQ s275 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Parking-PT-864-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-07 finished in 5977 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U G(p1))))'
Support contains 3 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1039 transition count 940
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1039 transition count 940
Applied a total of 2 rules in 47 ms. Remains 1039 /1040 variables (removed 1) and now considering 940/941 (removed 1) transitions.
// Phase 1: matrix 940 rows 1039 cols
[2024-05-27 21:19:43] [INFO ] Computed 203 invariants in 5 ms
[2024-05-27 21:19:44] [INFO ] Implicit Places using invariants in 1046 ms returned [195, 276]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1051 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1037/1040 places, 940/941 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1035 transition count 938
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1035 transition count 938
Applied a total of 4 rules in 81 ms. Remains 1035 /1037 variables (removed 2) and now considering 938/940 (removed 2) transitions.
// Phase 1: matrix 938 rows 1035 cols
[2024-05-27 21:19:44] [INFO ] Computed 201 invariants in 4 ms
[2024-05-27 21:19:45] [INFO ] Implicit Places using invariants in 1041 ms returned []
[2024-05-27 21:19:45] [INFO ] Invariant cache hit.
[2024-05-27 21:19:47] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-27 21:19:49] [INFO ] Implicit Places using invariants and state equation in 3532 ms returned []
Implicit Place search using SMT with State Equation took 4580 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1035/1040 places, 938/941 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5761 ms. Remains : 1035/1040 places, 938/941 transitions.
Stuttering acceptance computed with spot in 209 ms :[(NOT p1), (NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Running random walk in product with property : Parking-PT-864-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s378 1), p0:(AND (EQ s1030 1) (EQ s1031 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 139 steps with 34 reset in 6 ms.
FORMULA Parking-PT-864-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-08 finished in 6001 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0) U p0))||(X(!(G(!p1)||p2)) U p1)))'
Support contains 5 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1039 transition count 940
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1039 transition count 940
Applied a total of 2 rules in 62 ms. Remains 1039 /1040 variables (removed 1) and now considering 940/941 (removed 1) transitions.
// Phase 1: matrix 940 rows 1039 cols
[2024-05-27 21:19:49] [INFO ] Computed 203 invariants in 6 ms
[2024-05-27 21:19:50] [INFO ] Implicit Places using invariants in 1036 ms returned [195, 276, 1034]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1038 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1036/1040 places, 940/941 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1033 transition count 937
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1033 transition count 937
Applied a total of 6 rules in 47 ms. Remains 1033 /1036 variables (removed 3) and now considering 937/940 (removed 3) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2024-05-27 21:19:50] [INFO ] Computed 200 invariants in 4 ms
[2024-05-27 21:19:52] [INFO ] Implicit Places using invariants in 1234 ms returned []
[2024-05-27 21:19:52] [INFO ] Invariant cache hit.
[2024-05-27 21:19:53] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-27 21:19:55] [INFO ] Implicit Places using invariants and state equation in 2926 ms returned []
Implicit Place search using SMT with State Equation took 4171 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1033/1040 places, 937/941 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5321 ms. Remains : 1033/1040 places, 937/941 transitions.
Stuttering acceptance computed with spot in 267 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Running random walk in product with property : Parking-PT-864-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 2}, { cond=p2, acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s939 1) (EQ s981 1)), p2:(EQ s578 1), p0:(AND (EQ s47 1) (EQ s441 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 255 steps with 0 reset in 3 ms.
FORMULA Parking-PT-864-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-10 finished in 5622 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X((p1 U (p2||G(p1))))||p0))))'
Support contains 4 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Applied a total of 0 rules in 23 ms. Remains 1040 /1040 variables (removed 0) and now considering 941/941 (removed 0) transitions.
// Phase 1: matrix 941 rows 1040 cols
[2024-05-27 21:19:55] [INFO ] Computed 203 invariants in 3 ms
[2024-05-27 21:19:56] [INFO ] Implicit Places using invariants in 1184 ms returned [195, 276, 1035]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1187 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1037/1040 places, 941/941 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1034 transition count 938
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1034 transition count 938
Applied a total of 6 rules in 84 ms. Remains 1034 /1037 variables (removed 3) and now considering 938/941 (removed 3) transitions.
// Phase 1: matrix 938 rows 1034 cols
[2024-05-27 21:19:56] [INFO ] Computed 200 invariants in 5 ms
[2024-05-27 21:19:57] [INFO ] Implicit Places using invariants in 1262 ms returned []
[2024-05-27 21:19:57] [INFO ] Invariant cache hit.
[2024-05-27 21:19:58] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-27 21:20:01] [INFO ] Implicit Places using invariants and state equation in 3211 ms returned []
Implicit Place search using SMT with State Equation took 4478 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1034/1040 places, 938/941 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5776 ms. Remains : 1034/1040 places, 938/941 transitions.
Stuttering acceptance computed with spot in 153 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : Parking-PT-864-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p2) p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 p2), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p2:(AND (NOT (OR (NEQ s916 1) (AND (EQ s640 1) (EQ s686 1)))) (NEQ s397 1)), p1:(NEQ s397 1), p0:(OR (EQ s640 0) (EQ s686 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 390 reset in 1366 ms.
Product exploration explored 100000 steps with 387 reset in 1622 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 p0), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2)))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 214 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 39 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-27 21:20:05] [INFO ] Invariant cache hit.
[2024-05-27 21:20:05] [INFO ] [Real]Absence check using 200 positive place invariants in 86 ms returned sat
[2024-05-27 21:20:05] [INFO ] After 423ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-27 21:20:06] [INFO ] [Nat]Absence check using 200 positive place invariants in 90 ms returned sat
[2024-05-27 21:20:07] [INFO ] After 873ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-27 21:20:07] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-27 21:20:07] [INFO ] After 711ms SMT Verify possible using 248 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-27 21:20:08] [INFO ] Deduced a trap composed of 56 places in 86 ms of which 2 ms to minimize.
[2024-05-27 21:20:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 235 ms
[2024-05-27 21:20:08] [INFO ] After 1259ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 229 ms.
[2024-05-27 21:20:08] [INFO ] After 2862ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 2 properties in 23 ms.
Support contains 4 out of 1034 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1034/1034 places, 938/938 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 1034 transition count 907
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 63 place count 1003 transition count 906
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 1002 transition count 906
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 64 place count 1002 transition count 875
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 126 place count 971 transition count 875
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 3 with 96 rules applied. Total rules applied 222 place count 923 transition count 827
Free-agglomeration rule applied 263 times.
Iterating global reduction 3 with 263 rules applied. Total rules applied 485 place count 923 transition count 564
Reduce places removed 263 places and 0 transitions.
Graph (complete) has 1333 edges and 660 vertex of which 265 are kept as prefixes of interest. Removing 395 places using SCC suffix rule.1 ms
Discarding 395 places :
Also discarding 320 output transitions
Drop transitions removed 320 transitions
Iterating post reduction 3 with 264 rules applied. Total rules applied 749 place count 265 transition count 244
Drop transitions removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 4 with 30 rules applied. Total rules applied 779 place count 265 transition count 214
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 780 place count 264 transition count 213
Reduce places removed 85 places and 0 transitions.
Graph (trivial) has 168 edges and 179 vertex of which 115 / 179 are part of one of the 3 SCC in 5 ms
Free SCC test removed 112 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 87 rules applied. Total rules applied 867 place count 67 transition count 212
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 128 rules applied. Total rules applied 995 place count 66 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 996 place count 65 transition count 85
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 996 place count 65 transition count 84
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 998 place count 64 transition count 84
Discarding 14 places :
Symmetric choice reduction at 8 with 14 rule applications. Total rules 1012 place count 50 transition count 70
Iterating global reduction 8 with 14 rules applied. Total rules applied 1026 place count 50 transition count 70
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 1038 place count 38 transition count 58
Iterating global reduction 8 with 12 rules applied. Total rules applied 1050 place count 38 transition count 58
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 1062 place count 26 transition count 40
Iterating global reduction 8 with 12 rules applied. Total rules applied 1074 place count 26 transition count 40
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 1080 place count 26 transition count 34
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 1085 place count 21 transition count 29
Iterating global reduction 9 with 5 rules applied. Total rules applied 1090 place count 21 transition count 29
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 1095 place count 21 transition count 24
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 1103 place count 17 transition count 20
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1105 place count 17 transition count 18
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1106 place count 16 transition count 17
Iterating global reduction 11 with 1 rules applied. Total rules applied 1107 place count 16 transition count 17
Free-agglomeration rule applied 4 times.
Iterating global reduction 11 with 4 rules applied. Total rules applied 1111 place count 16 transition count 13
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 1115 place count 12 transition count 13
Applied a total of 1115 rules in 227 ms. Remains 12 /1034 variables (removed 1022) and now considering 13/938 (removed 925) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 227 ms. Remains : 12/1034 places, 13/938 transitions.
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2)))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p2) p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p2) (NOT p1))), (F (AND p2 p0)), (F (NOT (OR (AND (NOT p2) p1) (AND p2 (NOT p0)))))]
Knowledge based reduction with 6 factoid took 430 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 192 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 4 out of 1034 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1034/1034 places, 938/938 transitions.
Applied a total of 0 rules in 45 ms. Remains 1034 /1034 variables (removed 0) and now considering 938/938 (removed 0) transitions.
[2024-05-27 21:20:09] [INFO ] Invariant cache hit.
[2024-05-27 21:20:10] [INFO ] Implicit Places using invariants in 1087 ms returned []
[2024-05-27 21:20:10] [INFO ] Invariant cache hit.
[2024-05-27 21:20:11] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-27 21:20:14] [INFO ] Implicit Places using invariants and state equation in 3182 ms returned []
Implicit Place search using SMT with State Equation took 4280 ms to find 0 implicit places.
[2024-05-27 21:20:14] [INFO ] Invariant cache hit.
[2024-05-27 21:20:15] [INFO ] Dead Transitions using invariants and state equation in 1046 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5373 ms. Remains : 1034/1034 places, 938/938 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 p0), (X p0), (X (X p0)), (X (X (OR (AND (NOT p2) p1) (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 201 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 38 resets, run finished after 414 ms. (steps per millisecond=24 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-27 21:20:16] [INFO ] Invariant cache hit.
[2024-05-27 21:20:16] [INFO ] [Real]Absence check using 200 positive place invariants in 87 ms returned sat
[2024-05-27 21:20:16] [INFO ] After 468ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-27 21:20:17] [INFO ] [Nat]Absence check using 200 positive place invariants in 93 ms returned sat
[2024-05-27 21:20:18] [INFO ] After 916ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-27 21:20:18] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-27 21:20:18] [INFO ] After 606ms SMT Verify possible using 248 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-27 21:20:19] [INFO ] After 1067ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 243 ms.
[2024-05-27 21:20:19] [INFO ] After 2756ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 237 steps, including 1 resets, run visited all 3 properties in 14 ms. (steps per millisecond=16 )
Parikh walk visited 3 properties in 15 ms.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X p0), (X (X p0)), (X (X (OR (AND (NOT p2) p1) (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) (NOT p2))), (F (AND p0 p2)), (F (NOT (OR (AND p1 (NOT p2)) (AND (NOT p0) p2))))]
Knowledge based reduction with 6 factoid took 325 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 302 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 183 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 387 reset in 1308 ms.
Product exploration explored 100000 steps with 388 reset in 1264 ms.
Built C files in :
/tmp/ltsmin9180636479872006960
[2024-05-27 21:20:23] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9180636479872006960
Running compilation step : cd /tmp/ltsmin9180636479872006960;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2724 ms.
Running link step : cd /tmp/ltsmin9180636479872006960;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin9180636479872006960;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16321121106080155243.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 1034 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1034/1034 places, 938/938 transitions.
Applied a total of 0 rules in 69 ms. Remains 1034 /1034 variables (removed 0) and now considering 938/938 (removed 0) transitions.
[2024-05-27 21:20:38] [INFO ] Invariant cache hit.
[2024-05-27 21:20:39] [INFO ] Implicit Places using invariants in 1175 ms returned []
[2024-05-27 21:20:39] [INFO ] Invariant cache hit.
[2024-05-27 21:20:40] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-27 21:20:43] [INFO ] Implicit Places using invariants and state equation in 3966 ms returned []
Implicit Place search using SMT with State Equation took 5144 ms to find 0 implicit places.
[2024-05-27 21:20:43] [INFO ] Invariant cache hit.
[2024-05-27 21:20:44] [INFO ] Dead Transitions using invariants and state equation in 1398 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6612 ms. Remains : 1034/1034 places, 938/938 transitions.
Built C files in :
/tmp/ltsmin3452210856468672372
[2024-05-27 21:20:44] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3452210856468672372
Running compilation step : cd /tmp/ltsmin3452210856468672372;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin3452210856468672372;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin3452210856468672372;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-27 21:20:48] [INFO ] Flatten gal took : 61 ms
[2024-05-27 21:20:48] [INFO ] Flatten gal took : 60 ms
[2024-05-27 21:20:48] [INFO ] Time to serialize gal into /tmp/LTL15055736749024653624.gal : 8 ms
[2024-05-27 21:20:48] [INFO ] Time to serialize properties into /tmp/LTL17978862005072051732.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15055736749024653624.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6494473912230235945.hoa' '-atoms' '/tmp/LTL17978862005072051732.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17978862005072051732.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6494473912230235945.hoa
Detected timeout of ITS tools.
[2024-05-27 21:21:03] [INFO ] Flatten gal took : 34 ms
[2024-05-27 21:21:03] [INFO ] Flatten gal took : 58 ms
[2024-05-27 21:21:03] [INFO ] Time to serialize gal into /tmp/LTL5550679962647866042.gal : 7 ms
[2024-05-27 21:21:03] [INFO ] Time to serialize properties into /tmp/LTL6766331983871814930.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5550679962647866042.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6766331983871814930.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(G(("((p726==0)||(p781==0))")||(X(("(p441!=1)")U(("((!((p1048!=1)||((p726==1)&&(p781==1))))&&(p441!=1))")||(G("(p441!=1)")))))))))
Formula 0 simplified : XF(!"((p726==0)||(p781==0))" & X(!"(p441!=1)" M !"((!((p1048!=1)||((p726==1)&&(p781==1))))&&(p441!=1))"))
Detected timeout of ITS tools.
[2024-05-27 21:21:18] [INFO ] Flatten gal took : 53 ms
[2024-05-27 21:21:18] [INFO ] Applying decomposition
[2024-05-27 21:21:18] [INFO ] Flatten gal took : 53 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15406543049996447497.txt' '-o' '/tmp/graph15406543049996447497.bin' '-w' '/tmp/graph15406543049996447497.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15406543049996447497.bin' '-l' '-1' '-v' '-w' '/tmp/graph15406543049996447497.weights' '-q' '0' '-e' '0.001'
[2024-05-27 21:21:18] [INFO ] Decomposing Gal with order
[2024-05-27 21:21:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 21:21:18] [INFO ] Removed a total of 118 redundant transitions.
[2024-05-27 21:21:18] [INFO ] Flatten gal took : 113 ms
[2024-05-27 21:21:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 27 ms.
[2024-05-27 21:21:18] [INFO ] Time to serialize gal into /tmp/LTL16506321278675388164.gal : 18 ms
[2024-05-27 21:21:18] [INFO ] Time to serialize properties into /tmp/LTL2256863801192226704.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16506321278675388164.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2256863801192226704.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(G(("((i9.u250.p726==0)||(i9.u250.p781==0))")||(X(("(i7.u154.p441!=1)")U(("((!((i12.u329.p1048!=1)||((i9.u250.p726==1)&&(i9.u250.p...220
Formula 0 simplified : XF(!"((i9.u250.p726==0)||(i9.u250.p781==0))" & X(!"(i7.u154.p441!=1)" M !"((!((i12.u329.p1048!=1)||((i9.u250.p726==1)&&(i9.u250.p781...185
Reverse transition relation is NOT exact ! Due to transitions i5.u95.t241, i6.u134.t207, i7.u173.t173, i8.u211.t139, i9.u250.t105, i10.u290.t71, i12.t635, ...366
Computing Next relation with stutter on 5.35201e+12 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8221426359934858847
[2024-05-27 21:21:33] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8221426359934858847
Running compilation step : cd /tmp/ltsmin8221426359934858847;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2641 ms.
Running link step : cd /tmp/ltsmin8221426359934858847;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin8221426359934858847;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((X(((LTLAPp1==true) U ((LTLAPp2==true)||[]((LTLAPp1==true)))))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Parking-PT-864-LTLFireability-11 finished in 113704 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U p1))'
Support contains 4 out of 1040 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1040/1040 places, 941/941 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 1040 transition count 909
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1008 transition count 909
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 1008 transition count 877
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 976 transition count 877
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 129 place count 975 transition count 876
Iterating global reduction 2 with 1 rules applied. Total rules applied 130 place count 975 transition count 876
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 232 place count 924 transition count 825
Applied a total of 232 rules in 140 ms. Remains 924 /1040 variables (removed 116) and now considering 825/941 (removed 116) transitions.
// Phase 1: matrix 825 rows 924 cols
[2024-05-27 21:21:49] [INFO ] Computed 203 invariants in 14 ms
[2024-05-27 21:21:50] [INFO ] Implicit Places using invariants in 818 ms returned [181, 257, 920]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 822 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 921/1040 places, 825/941 transitions.
Applied a total of 0 rules in 54 ms. Remains 921 /921 variables (removed 0) and now considering 825/825 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1018 ms. Remains : 921/1040 places, 825/941 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), true, p0]
Running random walk in product with property : Parking-PT-864-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s69 1) (EQ s907 1)), p0:(AND (EQ s340 1) (EQ s375 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 49647 steps with 195 reset in 870 ms.
FORMULA Parking-PT-864-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-12 finished in 2010 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0&&X(p1)) U G(p2)))'
Support contains 4 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1039 transition count 940
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1039 transition count 940
Applied a total of 2 rules in 49 ms. Remains 1039 /1040 variables (removed 1) and now considering 940/941 (removed 1) transitions.
// Phase 1: matrix 940 rows 1039 cols
[2024-05-27 21:21:51] [INFO ] Computed 203 invariants in 4 ms
[2024-05-27 21:21:52] [INFO ] Implicit Places using invariants in 1103 ms returned [195, 1034]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1113 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1037/1040 places, 940/941 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1035 transition count 938
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1035 transition count 938
Applied a total of 4 rules in 79 ms. Remains 1035 /1037 variables (removed 2) and now considering 938/940 (removed 2) transitions.
// Phase 1: matrix 938 rows 1035 cols
[2024-05-27 21:21:52] [INFO ] Computed 201 invariants in 3 ms
[2024-05-27 21:21:53] [INFO ] Implicit Places using invariants in 974 ms returned []
[2024-05-27 21:21:53] [INFO ] Invariant cache hit.
[2024-05-27 21:21:54] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-27 21:21:56] [INFO ] Implicit Places using invariants and state equation in 3209 ms returned []
Implicit Place search using SMT with State Equation took 4195 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1035/1040 places, 938/941 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5437 ms. Remains : 1035/1040 places, 938/941 transitions.
Stuttering acceptance computed with spot in 215 ms :[(NOT p2), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-864-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p2 p0), acceptance={} source=0 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND p2 (NOT p1)) (AND (NOT p0) (NOT p1))), acceptance={} source=2 dest: 1}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}]], initial=0, aps=[p2:(AND (EQ s274 1) (EQ s341 1) (EQ s133 1) (EQ s221 1)), p0:(AND (EQ s274 1) (EQ s341 1)), p1:(AND (EQ s133 1) (EQ s221 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 1 reset in 0 ms.
FORMULA Parking-PT-864-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-13 finished in 5682 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)&&G((p1&&X((p1 U (X(p2)||G(p1))))))))))'
Support contains 3 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1039 transition count 940
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1039 transition count 940
Applied a total of 2 rules in 69 ms. Remains 1039 /1040 variables (removed 1) and now considering 940/941 (removed 1) transitions.
// Phase 1: matrix 940 rows 1039 cols
[2024-05-27 21:21:56] [INFO ] Computed 203 invariants in 5 ms
[2024-05-27 21:21:57] [INFO ] Implicit Places using invariants in 1015 ms returned [195, 276, 1034]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1018 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1036/1040 places, 940/941 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1033 transition count 937
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1033 transition count 937
Applied a total of 6 rules in 47 ms. Remains 1033 /1036 variables (removed 3) and now considering 937/940 (removed 3) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2024-05-27 21:21:57] [INFO ] Computed 200 invariants in 3 ms
[2024-05-27 21:21:58] [INFO ] Implicit Places using invariants in 828 ms returned []
[2024-05-27 21:21:58] [INFO ] Invariant cache hit.
[2024-05-27 21:21:59] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-27 21:22:02] [INFO ] Implicit Places using invariants and state equation in 3491 ms returned []
Implicit Place search using SMT with State Equation took 4326 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1033/1040 places, 937/941 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5461 ms. Remains : 1033/1040 places, 937/941 transitions.
Stuttering acceptance computed with spot in 348 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Parking-PT-864-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0, 1} source=1 dest: 1}, { cond=p1, acceptance={0, 1} source=1 dest: 2}, { cond=p1, acceptance={0, 1} source=1 dest: 3}, { cond=p1, acceptance={1} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={1} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0, 1} source=3 dest: 5}, { cond=p1, acceptance={0} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={0, 1} source=4 dest: 1}, { cond=p1, acceptance={0, 1} source=4 dest: 3}, { cond=p1, acceptance={1} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=5 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={1} source=5 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=6 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(NEQ s881 1), p0:(EQ s378 0), p2:(NEQ s251 1)], nbAcceptance=2, 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]]
Product exploration explored 100000 steps with 1349 reset in 2336 ms.
Product exploration explored 100000 steps with 1361 reset in 1833 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (X p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 146 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 369 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 38 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 5) seen :4
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.
[2024-05-27 21:22:07] [INFO ] Invariant cache hit.
[2024-05-27 21:22:07] [INFO ] After 267ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 21:22:08] [INFO ] [Nat]Absence check using 200 positive place invariants in 94 ms returned sat
[2024-05-27 21:22:09] [INFO ] After 772ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 21:22:09] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-27 21:22:09] [INFO ] After 151ms SMT Verify possible using 248 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-27 21:22:09] [INFO ] After 271ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 64 ms.
[2024-05-27 21:22:09] [INFO ] After 1518ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 84 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=14 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (X p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (NOT p1)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 350 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 408 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 404 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 1033 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1033/1033 places, 937/937 transitions.
Applied a total of 0 rules in 39 ms. Remains 1033 /1033 variables (removed 0) and now considering 937/937 (removed 0) transitions.
[2024-05-27 21:22:10] [INFO ] Invariant cache hit.
[2024-05-27 21:22:11] [INFO ] Implicit Places using invariants in 1049 ms returned []
[2024-05-27 21:22:11] [INFO ] Invariant cache hit.
[2024-05-27 21:22:12] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-27 21:22:14] [INFO ] Implicit Places using invariants and state equation in 3125 ms returned []
Implicit Place search using SMT with State Equation took 4176 ms to find 0 implicit places.
[2024-05-27 21:22:14] [INFO ] Invariant cache hit.
[2024-05-27 21:22:16] [INFO ] Dead Transitions using invariants and state equation in 1508 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5725 ms. Remains : 1033/1033 places, 937/937 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 158 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 409 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 38 resets, run finished after 397 ms. (steps per millisecond=25 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-27 21:22:17] [INFO ] Invariant cache hit.
[2024-05-27 21:22:17] [INFO ] After 294ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-27 21:22:18] [INFO ] [Nat]Absence check using 200 positive place invariants in 92 ms returned sat
[2024-05-27 21:22:19] [INFO ] After 952ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-27 21:22:19] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-27 21:22:19] [INFO ] After 213ms SMT Verify possible using 248 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-27 21:22:19] [INFO ] After 499ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 179 ms.
[2024-05-27 21:22:19] [INFO ] After 2086ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 208 steps, including 0 resets, run visited all 2 properties in 12 ms. (steps per millisecond=17 )
Parikh walk visited 2 properties in 12 ms.
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (NOT p1)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 374 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 415 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 412 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 419 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 1359 reset in 1797 ms.
Product exploration explored 100000 steps with 1329 reset in 1763 ms.
Built C files in :
/tmp/ltsmin1520540860714651258
[2024-05-27 21:22:25] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1520540860714651258
Running compilation step : cd /tmp/ltsmin1520540860714651258;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin1520540860714651258;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin1520540860714651258;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 1033 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1033/1033 places, 937/937 transitions.
Applied a total of 0 rules in 40 ms. Remains 1033 /1033 variables (removed 0) and now considering 937/937 (removed 0) transitions.
[2024-05-27 21:22:28] [INFO ] Invariant cache hit.
[2024-05-27 21:22:29] [INFO ] Implicit Places using invariants in 1093 ms returned []
[2024-05-27 21:22:29] [INFO ] Invariant cache hit.
[2024-05-27 21:22:30] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-27 21:22:32] [INFO ] Implicit Places using invariants and state equation in 3160 ms returned []
Implicit Place search using SMT with State Equation took 4257 ms to find 0 implicit places.
[2024-05-27 21:22:32] [INFO ] Invariant cache hit.
[2024-05-27 21:22:33] [INFO ] Dead Transitions using invariants and state equation in 1324 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5624 ms. Remains : 1033/1033 places, 937/937 transitions.
Built C files in :
/tmp/ltsmin7657728182193494389
[2024-05-27 21:22:33] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7657728182193494389
Running compilation step : cd /tmp/ltsmin7657728182193494389;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2937 ms.
Running link step : cd /tmp/ltsmin7657728182193494389;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin7657728182193494389;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15637398476863302667.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 21:22:49] [INFO ] Flatten gal took : 54 ms
[2024-05-27 21:22:49] [INFO ] Flatten gal took : 54 ms
[2024-05-27 21:22:49] [INFO ] Time to serialize gal into /tmp/LTL9513520075022924755.gal : 8 ms
[2024-05-27 21:22:49] [INFO ] Time to serialize properties into /tmp/LTL13952375262468524432.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9513520075022924755.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7930409382999314660.hoa' '-atoms' '/tmp/LTL13952375262468524432.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL13952375262468524432.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7930409382999314660.hoa
Detected timeout of ITS tools.
[2024-05-27 21:23:04] [INFO ] Flatten gal took : 52 ms
[2024-05-27 21:23:04] [INFO ] Flatten gal took : 62 ms
[2024-05-27 21:23:04] [INFO ] Time to serialize gal into /tmp/LTL879252582039164352.gal : 6 ms
[2024-05-27 21:23:04] [INFO ] Time to serialize properties into /tmp/LTL12991640156881940585.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL879252582039164352.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12991640156881940585.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(F((X("(p416==0)"))&&(G(("(p1009!=1)")&&(X(("(p1009!=1)")U((X("(p270!=1)"))||(G("(p1009!=1)")))))))))))
Formula 0 simplified : XG(X!"(p416==0)" | F(!"(p1009!=1)" | X(!"(p1009!=1)" M X!"(p270!=1)")))
Detected timeout of ITS tools.
[2024-05-27 21:23:19] [INFO ] Flatten gal took : 31 ms
[2024-05-27 21:23:19] [INFO ] Applying decomposition
[2024-05-27 21:23:19] [INFO ] Flatten gal took : 37 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2963197967217101892.txt' '-o' '/tmp/graph2963197967217101892.bin' '-w' '/tmp/graph2963197967217101892.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2963197967217101892.bin' '-l' '-1' '-v' '-w' '/tmp/graph2963197967217101892.weights' '-q' '0' '-e' '0.001'
[2024-05-27 21:23:19] [INFO ] Decomposing Gal with order
[2024-05-27 21:23:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 21:23:19] [INFO ] Removed a total of 118 redundant transitions.
[2024-05-27 21:23:19] [INFO ] Flatten gal took : 103 ms
[2024-05-27 21:23:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 20 ms.
[2024-05-27 21:23:19] [INFO ] Time to serialize gal into /tmp/LTL17341786147150678470.gal : 17 ms
[2024-05-27 21:23:19] [INFO ] Time to serialize properties into /tmp/LTL8411813750212572940.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17341786147150678470.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8411813750212572940.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(F((X("(i6.u151.p416==0)"))&&(G(("(i11.u316.p1009!=1)")&&(X(("(i11.u316.p1009!=1)")U((X("(i4.u107.p270!=1)"))||(G("(i11.u316.p1009...171
Formula 0 simplified : XG(X!"(i6.u151.p416==0)" | F(!"(i11.u316.p1009!=1)" | X(!"(i11.u316.p1009!=1)" M X!"(i4.u107.p270!=1)")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9275359659164069613
[2024-05-27 21:23:34] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9275359659164069613
Running compilation step : cd /tmp/ltsmin9275359659164069613;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2637 ms.
Running link step : cd /tmp/ltsmin9275359659164069613;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin9275359659164069613;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((X((LTLAPp0==true))&&[](((LTLAPp1==true)&&X(((LTLAPp1==true) U (X((LTLAPp2==true))||[]((LTLAPp1==true))))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Parking-PT-864-LTLFireability-14 finished in 113310 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&X(p1))))))'
Support contains 4 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1039 transition count 940
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1039 transition count 940
Applied a total of 2 rules in 52 ms. Remains 1039 /1040 variables (removed 1) and now considering 940/941 (removed 1) transitions.
// Phase 1: matrix 940 rows 1039 cols
[2024-05-27 21:23:50] [INFO ] Computed 203 invariants in 7 ms
[2024-05-27 21:23:51] [INFO ] Implicit Places using invariants in 1082 ms returned [195, 276, 1034]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1089 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1036/1040 places, 940/941 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1033 transition count 937
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1033 transition count 937
Applied a total of 6 rules in 79 ms. Remains 1033 /1036 variables (removed 3) and now considering 937/940 (removed 3) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2024-05-27 21:23:51] [INFO ] Computed 200 invariants in 3 ms
[2024-05-27 21:23:52] [INFO ] Implicit Places using invariants in 1110 ms returned []
[2024-05-27 21:23:52] [INFO ] Invariant cache hit.
[2024-05-27 21:23:53] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-27 21:23:55] [INFO ] Implicit Places using invariants and state equation in 2770 ms returned []
Implicit Place search using SMT with State Equation took 3905 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1033/1040 places, 937/941 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5125 ms. Remains : 1033/1040 places, 937/941 transitions.
Stuttering acceptance computed with spot in 194 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Parking-PT-864-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(OR (EQ s355 0) (EQ s449 0)), p1:(OR (EQ s984 0) (EQ s1032 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 726 steps with 2 reset in 9 ms.
FORMULA Parking-PT-864-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-15 finished in 5351 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||(!p1&&X((!p1 U (X(!p2)||G(!p1))))))))'
Found a Lengthening insensitive property : Parking-PT-864-LTLFireability-00
Stuttering acceptance computed with spot in 312 ms :[true, (NOT p0), (OR (NOT p0) p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2))]
Support contains 6 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1040/1040 places, 941/941 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 1040 transition count 909
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1008 transition count 909
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 1008 transition count 877
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 976 transition count 877
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 129 place count 975 transition count 876
Iterating global reduction 2 with 1 rules applied. Total rules applied 130 place count 975 transition count 876
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 230 place count 925 transition count 826
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 231 place count 925 transition count 826
Applied a total of 231 rules in 222 ms. Remains 925 /1040 variables (removed 115) and now considering 826/941 (removed 115) transitions.
// Phase 1: matrix 826 rows 925 cols
[2024-05-27 21:23:56] [INFO ] Computed 203 invariants in 4 ms
[2024-05-27 21:23:57] [INFO ] Implicit Places using invariants in 1183 ms returned [182, 258, 921]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1193 ms to find 3 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 922/1040 places, 826/941 transitions.
Applied a total of 0 rules in 41 ms. Remains 922 /922 variables (removed 0) and now considering 826/826 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1458 ms. Remains : 922/1040 places, 826/941 transitions.
Running random walk in product with property : Parking-PT-864-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}], [{ cond=(OR (NOT p0) p2), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 p0), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(OR (AND p1 (NOT p0)) (AND p1 p2)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) p2)), acceptance={} source=5 dest: 5}]], initial=3, aps=[p0:(OR (EQ s329 0) (EQ s362 0)), p1:(AND (EQ s130 1) (EQ s164 1)), p2:(AND (EQ s334 1) (EQ s370 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 393 reset in 1631 ms.
Product exploration explored 100000 steps with 394 reset in 1865 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 p0 (NOT p1) (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) p0 (NOT p2)))), true, (X (X (NOT (AND p1 p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (OR (NOT p0) p2)))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p1 p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 298 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[true, (NOT p0), (OR (NOT p0) p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2))]
Incomplete random walk after 10000 steps, including 38 resets, run finished after 590 ms. (steps per millisecond=16 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) 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 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 826 rows 922 cols
[2024-05-27 21:24:02] [INFO ] Computed 200 invariants in 4 ms
[2024-05-27 21:24:02] [INFO ] After 334ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-27 21:24:03] [INFO ] [Nat]Absence check using 200 positive place invariants in 89 ms returned sat
[2024-05-27 21:24:04] [INFO ] After 1177ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-27 21:24:04] [INFO ] State equation strengthened by 344 read => feed constraints.
[2024-05-27 21:24:06] [INFO ] After 1976ms SMT Verify possible using 344 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2024-05-27 21:24:07] [INFO ] After 2986ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 651 ms.
[2024-05-27 21:24:08] [INFO ] After 5449ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Finished Parikh walk after 423 steps, including 1 resets, run visited all 4 properties in 29 ms. (steps per millisecond=14 )
Parikh walk visited 7 properties in 69 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) p0 (NOT p2)))), true, (X (X (NOT (AND p1 p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (OR (NOT p0) p2)))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p1 p2)))))]
False Knowledge obtained : [(F (AND p1 p0 (NOT p2))), (F (OR (NOT p0) p2)), (F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) p0 (NOT p2)))), (F (NOT p0)), (F (NOT (AND (NOT p1) p0))), (F (AND p1 p0)), (F (OR (AND p1 (NOT p0)) (AND p1 p2))), (F (AND (NOT p1) (NOT p0))), (F (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) p2)))]
Knowledge based reduction with 17 factoid took 1217 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 303 ms :[true, (NOT p0), (OR (NOT p0) p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2))]
Stuttering acceptance computed with spot in 315 ms :[true, (NOT p0), (OR (NOT p0) p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2))]
Support contains 6 out of 922 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 922/922 places, 826/826 transitions.
Applied a total of 0 rules in 29 ms. Remains 922 /922 variables (removed 0) and now considering 826/826 (removed 0) transitions.
[2024-05-27 21:24:10] [INFO ] Invariant cache hit.
[2024-05-27 21:24:11] [INFO ] Implicit Places using invariants in 1009 ms returned []
[2024-05-27 21:24:11] [INFO ] Invariant cache hit.
[2024-05-27 21:24:11] [INFO ] State equation strengthened by 344 read => feed constraints.
[2024-05-27 21:24:14] [INFO ] Implicit Places using invariants and state equation in 3516 ms returned []
Implicit Place search using SMT with State Equation took 4529 ms to find 0 implicit places.
[2024-05-27 21:24:14] [INFO ] Invariant cache hit.
[2024-05-27 21:24:15] [INFO ] Dead Transitions using invariants and state equation in 929 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5488 ms. Remains : 922/922 places, 826/826 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (OR (NOT p0) p2)))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p1 p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 272 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 285 ms :[true, (NOT p0), (OR (NOT p0) p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2))]
Incomplete random walk after 10000 steps, including 39 resets, run finished after 561 ms. (steps per millisecond=17 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) 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 7) seen :0
Running SMT prover for 7 properties.
[2024-05-27 21:24:17] [INFO ] Invariant cache hit.
[2024-05-27 21:24:17] [INFO ] After 247ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-27 21:24:17] [INFO ] [Nat]Absence check using 200 positive place invariants in 87 ms returned sat
[2024-05-27 21:24:19] [INFO ] After 1194ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-27 21:24:19] [INFO ] State equation strengthened by 344 read => feed constraints.
[2024-05-27 21:24:19] [INFO ] After 680ms SMT Verify possible using 344 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2024-05-27 21:24:20] [INFO ] After 1559ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 568 ms.
[2024-05-27 21:24:21] [INFO ] After 3992ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 4 different solutions.
Finished Parikh walk after 206 steps, including 0 resets, run visited all 2 properties in 12 ms. (steps per millisecond=17 )
Parikh walk visited 7 properties in 110 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (OR (NOT p0) p2)))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p1 p2)))))]
False Knowledge obtained : [(F (AND p0 p1 (NOT p2))), (F (OR (NOT p0) p2)), (F (AND (NOT p0) p1)), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (AND p0 p1)), (F (OR (AND (NOT p0) p1) (AND p1 p2))), (F (AND (NOT p0) (NOT p1))), (F (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)))]
Knowledge based reduction with 15 factoid took 1140 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 326 ms :[true, (NOT p0), (OR (NOT p0) p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2))]
Stuttering acceptance computed with spot in 300 ms :[true, (NOT p0), (OR (NOT p0) p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2))]
Stuttering acceptance computed with spot in 309 ms :[true, (NOT p0), (OR (NOT p0) p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2))]
Product exploration explored 100000 steps with 391 reset in 1582 ms.
Product exploration explored 100000 steps with 391 reset in 1463 ms.
Built C files in :
/tmp/ltsmin11723163522483697723
[2024-05-27 21:24:26] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11723163522483697723
Running compilation step : cd /tmp/ltsmin11723163522483697723;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2435 ms.
Running link step : cd /tmp/ltsmin11723163522483697723;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin11723163522483697723;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13092201332527804555.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 922 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 922/922 places, 826/826 transitions.
Applied a total of 0 rules in 17 ms. Remains 922 /922 variables (removed 0) and now considering 826/826 (removed 0) transitions.
[2024-05-27 21:24:41] [INFO ] Invariant cache hit.
[2024-05-27 21:24:43] [INFO ] Implicit Places using invariants in 1132 ms returned []
[2024-05-27 21:24:43] [INFO ] Invariant cache hit.
[2024-05-27 21:24:43] [INFO ] State equation strengthened by 344 read => feed constraints.
[2024-05-27 21:24:46] [INFO ] Implicit Places using invariants and state equation in 3006 ms returned []
Implicit Place search using SMT with State Equation took 4142 ms to find 0 implicit places.
[2024-05-27 21:24:46] [INFO ] Invariant cache hit.
[2024-05-27 21:24:47] [INFO ] Dead Transitions using invariants and state equation in 1049 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5211 ms. Remains : 922/922 places, 826/826 transitions.
Built C files in :
/tmp/ltsmin6039860198000171115
[2024-05-27 21:24:47] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6039860198000171115
Running compilation step : cd /tmp/ltsmin6039860198000171115;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2531 ms.
Running link step : cd /tmp/ltsmin6039860198000171115;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin6039860198000171115;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14754519273845447282.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 21:25:02] [INFO ] Flatten gal took : 32 ms
[2024-05-27 21:25:02] [INFO ] Flatten gal took : 25 ms
[2024-05-27 21:25:02] [INFO ] Time to serialize gal into /tmp/LTL17729858378795583547.gal : 7 ms
[2024-05-27 21:25:02] [INFO ] Time to serialize properties into /tmp/LTL1735941583601527517.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17729858378795583547.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5959235737719727054.hoa' '-atoms' '/tmp/LTL1735941583601527517.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((X("((p394==0)||(p438==0))"))||((X((!("((p130==1)&&(p179==1))"))U((X(!("((p399==1)&&(p451==1))")))||(G(!("((p130==1)&&(p179==1))"...193
Formula 0 simplified : F(X!"((p394==0)||(p438==0))" & (!"((p130!=1)||(p179!=1))" | X("((p130==1)&&(p179==1))" M X"((p399==1)&&(p451==1))")))
Detected timeout of ITS tools.
[2024-05-27 21:25:32] [INFO ] Flatten gal took : 44 ms
[2024-05-27 21:25:32] [INFO ] Applying decomposition
[2024-05-27 21:25:32] [INFO ] Flatten gal took : 47 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph4237421422519754943.txt' '-o' '/tmp/graph4237421422519754943.bin' '-w' '/tmp/graph4237421422519754943.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4237421422519754943.bin' '-l' '-1' '-v' '-w' '/tmp/graph4237421422519754943.weights' '-q' '0' '-e' '0.001'
[2024-05-27 21:25:32] [INFO ] Decomposing Gal with order
[2024-05-27 21:25:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 21:25:32] [INFO ] Removed a total of 248 redundant transitions.
[2024-05-27 21:25:32] [INFO ] Flatten gal took : 55 ms
[2024-05-27 21:25:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 126 labels/synchronizations in 31 ms.
[2024-05-27 21:25:33] [INFO ] Time to serialize gal into /tmp/LTL250644927310937181.gal : 14 ms
[2024-05-27 21:25:33] [INFO ] Time to serialize properties into /tmp/LTL714156077394024861.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL250644927310937181.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL714156077394024861.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...252
Read 1 LTL properties
Checking formula 0 : !((G((X("((i5.u141.p394==0)||(i5.u154.p438==0))"))||((X((!("((i2.u65.p130==1)&&(i2.u77.p179==1))"))U((X(!("((i5.u144.p399==1)&&(i5.u17...267
Formula 0 simplified : F(X!"((i5.u141.p394==0)||(i5.u154.p438==0))" & (!"((i2.u65.p130!=1)||(i2.u77.p179!=1))" | X("((i2.u65.p130==1)&&(i2.u77.p179==1))" M...200
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 5.35201e+12 deadlock states
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
1385 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,14.0829,387208,1,0,390713,784,7589,3.64365e+06,259,1831,348275
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
Detected timeout of ITS tools.
Treatment of property Parking-PT-864-LTLFireability-00 finished in 112664 ms.
FORMULA Parking-PT-864-LTLFireability-00 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X((p1 U (p2||G(p1))))||p0))))'
Found a Lengthening insensitive property : Parking-PT-864-LTLFireability-11
Stuttering acceptance computed with spot in 144 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 4 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Reduce places removed 1 places and 1 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 1039 transition count 909
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 63 place count 1008 transition count 908
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 1007 transition count 908
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 64 place count 1007 transition count 877
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 126 place count 976 transition count 877
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 228 place count 925 transition count 826
Applied a total of 228 rules in 88 ms. Remains 925 /1040 variables (removed 115) and now considering 826/941 (removed 115) transitions.
// Phase 1: matrix 826 rows 925 cols
[2024-05-27 21:25:48] [INFO ] Computed 203 invariants in 3 ms
[2024-05-27 21:25:49] [INFO ] Implicit Places using invariants in 1208 ms returned [180, 256, 921]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1210 ms to find 3 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 922/1040 places, 826/941 transitions.
Applied a total of 0 rules in 45 ms. Remains 922 /922 variables (removed 0) and now considering 826/826 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1344 ms. Remains : 922/1040 places, 826/941 transitions.
Running random walk in product with property : Parking-PT-864-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p2) p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 p2), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p2:(AND (NOT (OR (NEQ s818 1) (AND (EQ s575 1) (EQ s616 1)))) (NEQ s362 1)), p1:(NEQ s362 1), p0:(OR (EQ s575 0) (EQ s616 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 392 reset in 1417 ms.
Entered a terminal (fully accepting) state of product in 97973 steps with 390 reset in 1258 ms.
Treatment of property Parking-PT-864-LTLFireability-11 finished in 4273 ms.
FORMULA Parking-PT-864-LTLFireability-11 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)&&G((p1&&X((p1 U (X(p2)||G(p1))))))))))'
Found a Shortening insensitive property : Parking-PT-864-LTLFireability-14
Stuttering acceptance computed with spot in 422 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1040/1040 places, 941/941 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 1040 transition count 910
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 63 place count 1009 transition count 909
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 1008 transition count 909
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 64 place count 1008 transition count 878
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 126 place count 977 transition count 878
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 127 place count 976 transition count 877
Iterating global reduction 3 with 1 rules applied. Total rules applied 128 place count 976 transition count 877
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 228 place count 926 transition count 827
Applied a total of 228 rules in 152 ms. Remains 926 /1040 variables (removed 114) and now considering 827/941 (removed 114) transitions.
// Phase 1: matrix 827 rows 926 cols
[2024-05-27 21:25:53] [INFO ] Computed 203 invariants in 4 ms
[2024-05-27 21:25:53] [INFO ] Implicit Places using invariants in 911 ms returned [181, 257, 922]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 921 ms to find 3 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 923/1040 places, 827/941 transitions.
Applied a total of 0 rules in 36 ms. Remains 923 /923 variables (removed 0) and now considering 827/827 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1114 ms. Remains : 923/1040 places, 827/941 transitions.
Running random walk in product with property : Parking-PT-864-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0, 1} source=1 dest: 1}, { cond=p1, acceptance={0, 1} source=1 dest: 2}, { cond=p1, acceptance={0, 1} source=1 dest: 3}, { cond=p1, acceptance={1} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={1} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0, 1} source=3 dest: 5}, { cond=p1, acceptance={0} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={0, 1} source=4 dest: 1}, { cond=p1, acceptance={0, 1} source=4 dest: 3}, { cond=p1, acceptance={1} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=5 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={1} source=5 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=6 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(NEQ s786 1), p0:(EQ s349 0), p2:(NEQ s237 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1379 reset in 2104 ms.
Product exploration explored 100000 steps with 1383 reset in 1947 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (X p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 136 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 327 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 38 resets, run finished after 564 ms. (steps per millisecond=17 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) 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
Running SMT prover for 3 properties.
// Phase 1: matrix 827 rows 923 cols
[2024-05-27 21:25:59] [INFO ] Computed 200 invariants in 3 ms
[2024-05-27 21:25:59] [INFO ] [Real]Absence check using 200 positive place invariants in 106 ms returned sat
[2024-05-27 21:25:59] [INFO ] After 445ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-27 21:26:00] [INFO ] [Nat]Absence check using 200 positive place invariants in 96 ms returned sat
[2024-05-27 21:26:01] [INFO ] After 954ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-27 21:26:01] [INFO ] State equation strengthened by 343 read => feed constraints.
[2024-05-27 21:26:02] [INFO ] After 925ms SMT Verify possible using 343 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-27 21:26:02] [INFO ] After 1262ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 295 ms.
[2024-05-27 21:26:02] [INFO ] After 2981ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 207 steps, including 0 resets, run visited all 3 properties in 12 ms. (steps per millisecond=17 )
Parikh walk visited 3 properties in 12 ms.
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (X p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (NOT p1)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 373 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 408 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 427 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 923/923 places, 827/827 transitions.
Applied a total of 0 rules in 31 ms. Remains 923 /923 variables (removed 0) and now considering 827/827 (removed 0) transitions.
[2024-05-27 21:26:04] [INFO ] Invariant cache hit.
[2024-05-27 21:26:05] [INFO ] Implicit Places using invariants in 1152 ms returned []
[2024-05-27 21:26:05] [INFO ] Invariant cache hit.
[2024-05-27 21:26:06] [INFO ] State equation strengthened by 343 read => feed constraints.
[2024-05-27 21:26:08] [INFO ] Implicit Places using invariants and state equation in 3379 ms returned []
Implicit Place search using SMT with State Equation took 4539 ms to find 0 implicit places.
[2024-05-27 21:26:08] [INFO ] Invariant cache hit.
[2024-05-27 21:26:09] [INFO ] Dead Transitions using invariants and state equation in 1013 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5589 ms. Remains : 923/923 places, 827/827 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 135 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 380 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 39 resets, run finished after 412 ms. (steps per millisecond=24 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-27 21:26:10] [INFO ] Invariant cache hit.
[2024-05-27 21:26:10] [INFO ] After 241ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 21:26:11] [INFO ] [Nat]Absence check using 200 positive place invariants in 87 ms returned sat
[2024-05-27 21:26:12] [INFO ] After 789ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 21:26:12] [INFO ] State equation strengthened by 343 read => feed constraints.
[2024-05-27 21:26:12] [INFO ] After 275ms SMT Verify possible using 343 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-27 21:26:12] [INFO ] After 367ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 78 ms.
[2024-05-27 21:26:12] [INFO ] After 1605ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 104 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=34 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (NOT p1)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 375 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 412 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 402 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 407 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 1311 reset in 2238 ms.
Product exploration explored 100000 steps with 1336 reset in 1975 ms.
Built C files in :
/tmp/ltsmin2843419255874742806
[2024-05-27 21:26:18] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2843419255874742806
Running compilation step : cd /tmp/ltsmin2843419255874742806;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2812 ms.
Running link step : cd /tmp/ltsmin2843419255874742806;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin2843419255874742806;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11568120673111171210.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 923/923 places, 827/827 transitions.
Applied a total of 0 rules in 19 ms. Remains 923 /923 variables (removed 0) and now considering 827/827 (removed 0) transitions.
[2024-05-27 21:26:33] [INFO ] Invariant cache hit.
[2024-05-27 21:26:34] [INFO ] Implicit Places using invariants in 601 ms returned []
[2024-05-27 21:26:34] [INFO ] Invariant cache hit.
[2024-05-27 21:26:34] [INFO ] State equation strengthened by 343 read => feed constraints.
[2024-05-27 21:26:36] [INFO ] Implicit Places using invariants and state equation in 2774 ms returned []
Implicit Place search using SMT with State Equation took 3389 ms to find 0 implicit places.
[2024-05-27 21:26:36] [INFO ] Invariant cache hit.
[2024-05-27 21:26:37] [INFO ] Dead Transitions using invariants and state equation in 806 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4224 ms. Remains : 923/923 places, 827/827 transitions.
Built C files in :
/tmp/ltsmin1627379156728763479
[2024-05-27 21:26:37] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1627379156728763479
Running compilation step : cd /tmp/ltsmin1627379156728763479;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2160 ms.
Running link step : cd /tmp/ltsmin1627379156728763479;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin1627379156728763479;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4947815998265106974.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 21:26:52] [INFO ] Flatten gal took : 29 ms
[2024-05-27 21:26:52] [INFO ] Flatten gal took : 33 ms
[2024-05-27 21:26:52] [INFO ] Time to serialize gal into /tmp/LTL8575264030723542490.gal : 6 ms
[2024-05-27 21:26:52] [INFO ] Time to serialize properties into /tmp/LTL1595984662506158333.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8575264030723542490.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8570980517453434725.hoa' '-atoms' '/tmp/LTL1595984662506158333.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL1595984662506158333.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8570980517453434725.hoa
Detected timeout of ITS tools.
[2024-05-27 21:27:08] [INFO ] Flatten gal took : 28 ms
[2024-05-27 21:27:08] [INFO ] Flatten gal took : 27 ms
[2024-05-27 21:27:08] [INFO ] Time to serialize gal into /tmp/LTL1692944545290992106.gal : 5 ms
[2024-05-27 21:27:08] [INFO ] Time to serialize properties into /tmp/LTL17226690755198498619.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1692944545290992106.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17226690755198498619.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F((X("(p416==0)"))&&(G(("(p1009!=1)")&&(X(("(p1009!=1)")U((X("(p270!=1)"))||(G("(p1009!=1)")))))))))))
Formula 0 simplified : XG(X!"(p416==0)" | F(!"(p1009!=1)" | X(!"(p1009!=1)" M X!"(p270!=1)")))
Detected timeout of ITS tools.
[2024-05-27 21:27:23] [INFO ] Flatten gal took : 23 ms
[2024-05-27 21:27:23] [INFO ] Applying decomposition
[2024-05-27 21:27:23] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2819560301305977272.txt' '-o' '/tmp/graph2819560301305977272.bin' '-w' '/tmp/graph2819560301305977272.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2819560301305977272.bin' '-l' '-1' '-v' '-w' '/tmp/graph2819560301305977272.weights' '-q' '0' '-e' '0.001'
[2024-05-27 21:27:23] [INFO ] Decomposing Gal with order
[2024-05-27 21:27:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 21:27:23] [INFO ] Removed a total of 247 redundant transitions.
[2024-05-27 21:27:23] [INFO ] Flatten gal took : 66 ms
[2024-05-27 21:27:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 126 labels/synchronizations in 25 ms.
[2024-05-27 21:27:23] [INFO ] Time to serialize gal into /tmp/LTL2868227082792424413.gal : 19 ms
[2024-05-27 21:27:23] [INFO ] Time to serialize properties into /tmp/LTL10360833683806086263.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2868227082792424413.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10360833683806086263.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(F((X("(i7.u151.p416==0)"))&&(G(("(i12.u312.p1009!=1)")&&(X(("(i12.u312.p1009!=1)")U((X("(i5.u107.p270!=1)"))||(G("(i12.u312.p1009...171
Formula 0 simplified : XG(X!"(i7.u151.p416==0)" | F(!"(i12.u312.p1009!=1)" | X(!"(i12.u312.p1009!=1)" M X!"(i5.u107.p270!=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.
Built C files in :
/tmp/ltsmin13625147521858537671
[2024-05-27 21:27:38] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13625147521858537671
Running compilation step : cd /tmp/ltsmin13625147521858537671;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2399 ms.
Running link step : cd /tmp/ltsmin13625147521858537671;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin13625147521858537671;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((X((LTLAPp0==true))&&[](((LTLAPp1==true)&&X(((LTLAPp1==true) U (X((LTLAPp2==true))||[]((LTLAPp1==true))))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Parking-PT-864-LTLFireability-14 finished in 121293 ms.
[2024-05-27 21:27:53] [INFO ] Flatten gal took : 25 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1882435853502334984
[2024-05-27 21:27:53] [INFO ] Computing symmetric may disable matrix : 941 transitions.
[2024-05-27 21:27:53] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:27:53] [INFO ] Computing symmetric may enable matrix : 941 transitions.
[2024-05-27 21:27:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:27:53] [INFO ] Applying decomposition
[2024-05-27 21:27:53] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15875582337300218507.txt' '-o' '/tmp/graph15875582337300218507.bin' '-w' '/tmp/graph15875582337300218507.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15875582337300218507.bin' '-l' '-1' '-v' '-w' '/tmp/graph15875582337300218507.weights' '-q' '0' '-e' '0.001'
[2024-05-27 21:27:53] [INFO ] Decomposing Gal with order
[2024-05-27 21:27:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 21:27:53] [INFO ] Computing Do-Not-Accords matrix : 941 transitions.
[2024-05-27 21:27:53] [INFO ] Computation of Completed DNA matrix. took 37 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:27:53] [INFO ] Built C files in 200ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1882435853502334984
Running compilation step : cd /tmp/ltsmin1882435853502334984;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-27 21:27:53] [INFO ] Removed a total of 120 redundant transitions.
[2024-05-27 21:27:53] [INFO ] Flatten gal took : 49 ms
[2024-05-27 21:27:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2024-05-27 21:27:53] [INFO ] Time to serialize gal into /tmp/LTLFireability15664164595813189131.gal : 11 ms
[2024-05-27 21:27:53] [INFO ] Time to serialize properties into /tmp/LTLFireability16052443683427144573.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15664164595813189131.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16052443683427144573.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((X(F((X("(i6.u155.p416==0)"))&&(G(("(i12.u319.p1009!=1)")&&(X(("(i12.u319.p1009!=1)")U((X("(i4.u108.p270!=1)"))||(G("(i12.u319.p1009...171
Formula 0 simplified : XG(X!"(i6.u155.p416==0)" | F(!"(i12.u319.p1009!=1)" | X(!"(i12.u319.p1009!=1)" M X!"(i4.u108.p270!=1)")))
Compilation finished in 4282 ms.
Running link step : cd /tmp/ltsmin1882435853502334984;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 93 ms.
Running LTSmin : cd /tmp/ltsmin1882435853502334984;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((X((LTLAPp6==true))&&[](((LTLAPp7==true)&&X(((LTLAPp7==true) U (X((LTLAPp8==true))||[]((LTLAPp7==true))))))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions i3.u96.t241, i4.u137.t207, i6.u176.t173, i7.u216.t139, i9.u255.t105, i11.u294.t71, i12.t635, ...366
Computing Next relation with stutter on 5.35201e+12 deadlock states
7 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
8606 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,86.3078,1788812,1,0,2.99077e+06,10120,13597,1.33261e+07,1011,50013,2084615
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-864-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 898994 ms.

BK_STOP 1716845496921

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
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 r285-smll-171654421900063"
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 ;