Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r292-tall-162124156700565.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is LeafsetExtension-PT-S64C4, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r292-tall-162124156700565
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 33M
-rw-r--r-- 1 mcc users 47K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 172K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 26K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 90K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.4K May 12 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 12 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K May 12 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 12 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 3.8K May 11 18:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K May 11 18:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 11 15:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K May 11 15:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 12 04:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 6 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 33M May 12 08:13 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 LeafsetExtension-PT-S64C4-00
FORMULA_NAME LeafsetExtension-PT-S64C4-01
FORMULA_NAME LeafsetExtension-PT-S64C4-02
FORMULA_NAME LeafsetExtension-PT-S64C4-03
FORMULA_NAME LeafsetExtension-PT-S64C4-04
FORMULA_NAME LeafsetExtension-PT-S64C4-05
FORMULA_NAME LeafsetExtension-PT-S64C4-06
FORMULA_NAME LeafsetExtension-PT-S64C4-07
FORMULA_NAME LeafsetExtension-PT-S64C4-08
FORMULA_NAME LeafsetExtension-PT-S64C4-09
FORMULA_NAME LeafsetExtension-PT-S64C4-10
FORMULA_NAME LeafsetExtension-PT-S64C4-11
FORMULA_NAME LeafsetExtension-PT-S64C4-12
FORMULA_NAME LeafsetExtension-PT-S64C4-13
FORMULA_NAME LeafsetExtension-PT-S64C4-14
FORMULA_NAME LeafsetExtension-PT-S64C4-15

=== Now, execution of the tool begins

BK_START 1621318482362

Running Version 0
[2021-05-18 06:14:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-18 06:14:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 06:14:44] [INFO ] Load time of PNML (sax parser for PT used): 939 ms
[2021-05-18 06:14:45] [INFO ] Transformed 21462 places.
[2021-05-18 06:14:45] [INFO ] Transformed 21129 transitions.
[2021-05-18 06:14:45] [INFO ] Parsed PT model containing 21462 places and 21129 transitions in 1101 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
[2021-05-18 06:14:45] [INFO ] Initial state test concluded for 4 properties.
FORMULA LeafsetExtension-PT-S64C4-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 21462 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 21462/21462 places, 21129/21129 transitions.
Reduce places removed 4229 places and 0 transitions.
Iterating post reduction 0 with 4229 rules applied. Total rules applied 4229 place count 17233 transition count 21129
Applied a total of 4229 rules in 314 ms. Remains 17233 /21462 variables (removed 4229) and now considering 21129/21129 (removed 0) transitions.
// Phase 1: matrix 21129 rows 17233 cols
[2021-05-18 06:14:48] [INFO ] Computed 198 place invariants in 2826 ms
[2021-05-18 06:14:50] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 06:14:50] [INFO ] Implicit Places using invariants in 4988 ms returned []
Implicit Place search using SMT only with invariants took 5022 ms to find 0 implicit places.
// Phase 1: matrix 21129 rows 17233 cols
[2021-05-18 06:14:53] [INFO ] Computed 198 place invariants in 2701 ms
[2021-05-18 06:14:55] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 06:14:55] [INFO ] Dead Transitions using invariants and state equation in 4482 ms returned []
Finished structural reductions, in 1 iterations. Remains : 17233/21462 places, 21129/21129 transitions.
[2021-05-18 06:14:56] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-18 06:14:56] [INFO ] Flatten gal took : 960 ms
FORMULA LeafsetExtension-PT-S64C4-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 06:14:57] [INFO ] Flatten gal took : 707 ms
[2021-05-18 06:14:58] [INFO ] Input system was already deterministic with 21129 transitions.
Incomplete random walk after 100000 steps, including 3008 resets, run finished after 2488 ms. (steps per millisecond=40 ) properties (out of 31) seen :30
Running SMT prover for 1 properties.
// Phase 1: matrix 21129 rows 17233 cols
[2021-05-18 06:15:03] [INFO ] Computed 198 place invariants in 2543 ms
[2021-05-18 06:15:06] [INFO ] [Real]Absence check using 0 positive and 198 generalized place invariants in 366 ms returned sat
[2021-05-18 06:15:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 06:15:39] [INFO ] [Real]Absence check using state equation in 33145 ms returned unsat :0 sat :1 real:0
Attempting to minimize the solution found.
Minimization took 835 ms.
[2021-05-18 06:15:40] [INFO ] SMT Verify possible in real domain returnedunsat :0 sat :1 real:0
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((F(p0)&&G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 17233 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 177 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
// Phase 1: matrix 21129 rows 17233 cols
[2021-05-18 06:15:43] [INFO ] Computed 198 place invariants in 2583 ms
[2021-05-18 06:15:45] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 06:15:45] [INFO ] Implicit Places using invariants in 4274 ms returned []
Implicit Place search using SMT only with invariants took 4276 ms to find 0 implicit places.
// Phase 1: matrix 21129 rows 17233 cols
[2021-05-18 06:15:47] [INFO ] Computed 198 place invariants in 2497 ms
[2021-05-18 06:15:49] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 06:15:49] [INFO ] Dead Transitions using invariants and state equation in 4257 ms returned []
Finished structural reductions, in 1 iterations. Remains : 17233/17233 places, 21129/21129 transitions.
Stuttering acceptance computed with spot in 297 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : LeafsetExtension-PT-S64C4-00 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=4 dest: 0}, { cond=(NOT p1), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}]], initial=2, aps=[p1:(LT s15390 1), p0:(GEQ s12828 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 7 ms.
FORMULA LeafsetExtension-PT-S64C4-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S64C4-00 finished in 9165 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((G((p0&&X((p0 U (G(p0)||p1)))))||(p0&&X((G(F((p2 U (p3||G(p2)))))&&(p0 U (G(p0)||p4)))))) U G(p5)))], workingDir=/home/mcc/execution]
Support contains 7 out of 17233 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 96 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
// Phase 1: matrix 21129 rows 17233 cols
[2021-05-18 06:15:52] [INFO ] Computed 198 place invariants in 2423 ms
[2021-05-18 06:15:54] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 06:15:54] [INFO ] Implicit Places using invariants in 4107 ms returned []
Implicit Place search using SMT only with invariants took 4108 ms to find 0 implicit places.
// Phase 1: matrix 21129 rows 17233 cols
[2021-05-18 06:15:56] [INFO ] Computed 198 place invariants in 2372 ms
[2021-05-18 06:15:57] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 06:15:58] [INFO ] Dead Transitions using invariants and state equation in 3978 ms returned []
Finished structural reductions, in 1 iterations. Remains : 17233/17233 places, 21129/21129 transitions.
Stuttering acceptance computed with spot in 320 ms :[(NOT p5), true, (NOT p5), (OR (AND (NOT p0) (NOT p2) (NOT p3) p4) (AND (NOT p0) (NOT p4) p5)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p0)), (AND p5 (NOT p0) (NOT p4))]
Running random walk in product with property : LeafsetExtension-PT-S64C4-01 automaton TGBA [mat=[[{ cond=(AND (NOT p5) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p5 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p5) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p5 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p5) p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p5), acceptance={} source=2 dest: 1}, { cond=p5, acceptance={} source=2 dest: 2}], [{ cond=(AND p5 (NOT p0) (NOT p4)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) p4), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p4), acceptance={} source=3 dest: 5}, { cond=p0, acceptance={} source=3 dest: 6}, { cond=(AND p0 (NOT p4)), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}], [{ cond=(AND p5 (NOT p0) (NOT p4)), acceptance={} source=7 dest: 1}, { cond=(AND p0 (NOT p4)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p5:(OR (LT s14203 1) (LT s15206 1)), p0:(OR (LT s14498 1) (LT s14725 1)), p4:(OR (LT s6574 1) (LT s16045 1)), p3:(AND (OR (LT s14498 1) (LT s14725 1)) (LT s11818 1)), p2:(LT s11818 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3017 reset in 2048 ms.
Product exploration explored 100000 steps with 3009 reset in 1984 ms.
Graph (complete) has 42513 edges and 17233 vertex of which 8649 are kept as prefixes of interest. Removing 8584 places using SCC suffix rule.137 ms
Knowledge obtained : [p5, p0, p4, p3, p2]
Stuttering acceptance computed with spot in 231 ms :[(NOT p5), true, (NOT p5), (OR (AND (NOT p0) (NOT p2) (NOT p3) p4) (AND (NOT p0) (NOT p4) p5)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p0)), (AND p5 (NOT p0) (NOT p4))]
Product exploration explored 100000 steps with 3008 reset in 1969 ms.
Product exploration explored 100000 steps with 3010 reset in 1994 ms.
Applying partial POR strategy [true, true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 223 ms :[(NOT p5), true, (NOT p5), (OR (AND (NOT p0) (NOT p2) (NOT p3) p4) (AND (NOT p0) (NOT p4) p5)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p0)), (AND p5 (NOT p0) (NOT p4))]
Support contains 7 out of 17233 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Performed 8318 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8318 rules applied. Total rules applied 8318 place count 17233 transition count 21129
Performed 129 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 129 Pre rules applied. Total rules applied 8318 place count 17233 transition count 25128
Deduced a syphon composed of 8447 places in 10 ms
Iterating global reduction 1 with 129 rules applied. Total rules applied 8447 place count 17233 transition count 25128
Discarding 3998 places :
Symmetric choice reduction at 1 with 3998 rule applications. Total rules 12445 place count 13235 transition count 17132
Deduced a syphon composed of 8447 places in 8 ms
Iterating global reduction 1 with 3998 rules applied. Total rules applied 16443 place count 13235 transition count 17132
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8449 places in 7 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 16445 place count 13235 transition count 17132
Deduced a syphon composed of 8449 places in 10 ms
Applied a total of 16445 rules in 4658 ms. Remains 13235 /17233 variables (removed 3998) and now considering 17132/21129 (removed 3997) transitions.
// Phase 1: matrix 17132 rows 13235 cols
[2021-05-18 06:16:12] [INFO ] Computed 198 place invariants in 623 ms
[2021-05-18 06:16:14] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 06:16:14] [INFO ] Dead Transitions using invariants and state equation in 2042 ms returned []
Finished structural reductions, in 1 iterations. Remains : 13235/17233 places, 17132/21129 transitions.
Product exploration explored 100000 steps with 4718 reset in 2141 ms.
Product exploration explored 100000 steps with 4710 reset in 2014 ms.
[2021-05-18 06:16:19] [INFO ] Flatten gal took : 668 ms
[2021-05-18 06:16:20] [INFO ] Flatten gal took : 723 ms
[2021-05-18 06:16:20] [INFO ] Time to serialize gal into /tmp/LTL6061024154775645387.gal : 172 ms
[2021-05-18 06:16:20] [INFO ] Time to serialize properties into /tmp/LTL7101229919965352777.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL6061024154775645387.gal, -t, CGAL, -LTL, /tmp/LTL7101229919965352777.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6061024154775645387.gal -t CGAL -LTL /tmp/LTL7101229919965352777.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((((G(("((Node55HasAskedItsLeafSetToLxToReplaceNode7<1)||(LeafSetOfLxIsSentToNode55<1))")&&(X(("((Node55HasAskedItsLeafSetToLxToReplaceNode7<1)||(LeafSetOfLxIsSentToNode55<1))")U(("((Node24DontAnswerToAnyNode<1)||(Node61IsActive<1))")||(G("((Node55HasAskedItsLeafSetToLxToReplaceNode7<1)||(LeafSetOfLxIsSentToNode55<1))")))))))||((X((G(F(("(Node44HasTheLeafSetOfRxToReplaceNode61<1)")U(("(((Node55HasAskedItsLeafSetToLxToReplaceNode7<1)||(LeafSetOfLxIsSentToNode55<1))&&(Node44HasTheLeafSetOfRxToReplaceNode61<1))")||(G("(Node44HasTheLeafSetOfRxToReplaceNode61<1)"))))))&&(("((Node55HasAskedItsLeafSetToLxToReplaceNode7<1)||(LeafSetOfLxIsSentToNode55<1))")U(("((Node24DontAnswerToAnyNode<1)||(Node61IsActive<1))")||(G("((Node55HasAskedItsLeafSetToLxToReplaceNode7<1)||(LeafSetOfLxIsSentToNode55<1))"))))))&&("((Node55HasAskedItsLeafSetToLxToReplaceNode7<1)||(LeafSetOfLxIsSentToNode55<1))")))U(G("((NoNodeManageTheBreakDownOfNode53<1)||(Node57WantsToManageTheBreakDownOfNode53<1))"))))
Formula 0 simplified : !((G("((Node55HasAskedItsLeafSetToLxToReplaceNode7<1)||(LeafSetOfLxIsSentToNode55<1))" & X("((Node55HasAskedItsLeafSetToLxToReplaceNode7<1)||(LeafSetOfLxIsSentToNode55<1))" U ("((Node24DontAnswerToAnyNode<1)||(Node61IsActive<1))" | G"((Node55HasAskedItsLeafSetToLxToReplaceNode7<1)||(LeafSetOfLxIsSentToNode55<1))"))) | ("((Node55HasAskedItsLeafSetToLxToReplaceNode7<1)||(LeafSetOfLxIsSentToNode55<1))" & X(("((Node55HasAskedItsLeafSetToLxToReplaceNode7<1)||(LeafSetOfLxIsSentToNode55<1))" U ("((Node24DontAnswerToAnyNode<1)||(Node61IsActive<1))" | G"((Node55HasAskedItsLeafSetToLxToReplaceNode7<1)||(LeafSetOfLxIsSentToNode55<1))")) & GF("(Node44HasTheLeafSetOfRxToReplaceNode61<1)" U ("(((Node55HasAskedItsLeafSetToLxToReplaceNode7<1)||(LeafSetOfLxIsSentToNode55<1))&&(Node44HasTheLeafSetOfRxToReplaceNode61<1))" | G"(Node44HasTheLeafSetOfRxToReplaceNode61<1)"))))) U G"((NoNodeManageTheBreakDownOfNode53<1)||(Node57WantsToManageTheBreakDownOfNode53<1))")
Detected timeout of ITS tools.
[2021-05-18 06:16:36] [INFO ] Flatten gal took : 700 ms
[2021-05-18 06:16:36] [INFO ] Applying decomposition
[2021-05-18 06:16:36] [INFO ] Flatten gal took : 627 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph1990560689125734756.txt, -o, /tmp/graph1990560689125734756.bin, -w, /tmp/graph1990560689125734756.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph1990560689125734756.bin, -l, -1, -v, -w, /tmp/graph1990560689125734756.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 06:16:38] [INFO ] Decomposing Gal with order
[2021-05-18 06:16:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 06:17:04] [INFO ] Removed a total of 16050 redundant transitions.
[2021-05-18 06:17:05] [INFO ] Flatten gal took : 7425 ms
[2021-05-18 06:17:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 398 labels/synchronizations in 449 ms.
[2021-05-18 06:17:06] [INFO ] Time to serialize gal into /tmp/LTL17799093298089841098.gal : 282 ms
[2021-05-18 06:17:06] [INFO ] Time to serialize properties into /tmp/LTL14142571183984871995.ltl : 9 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL17799093298089841098.gal, -t, CGAL, -LTL, /tmp/LTL14142571183984871995.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL17799093298089841098.gal -t CGAL -LTL /tmp/LTL14142571183984871995.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((((G(("((i69.u3586.Node55HasAskedItsLeafSetToLxToReplaceNode7<1)||(u4221.LeafSetOfLxIsSentToNode55<1))")&&(X(("((i69.u3586.Node55HasAskedItsLeafSetToLxToReplaceNode7<1)||(u4221.LeafSetOfLxIsSentToNode55<1))")U(("((i39.u34.Node24DontAnswerToAnyNode<1)||(i24.i0.i12.u3964.Node61IsActive<1))")||(G("((i69.u3586.Node55HasAskedItsLeafSetToLxToReplaceNode7<1)||(u4221.LeafSetOfLxIsSentToNode55<1))")))))))||((X((G(F(("(u4222.Node44HasTheLeafSetOfRxToReplaceNode61<1)")U(("(((i69.u3586.Node55HasAskedItsLeafSetToLxToReplaceNode7<1)||(u4221.LeafSetOfLxIsSentToNode55<1))&&(u4222.Node44HasTheLeafSetOfRxToReplaceNode61<1))")||(G("(u4222.Node44HasTheLeafSetOfRxToReplaceNode61<1)"))))))&&(("((i69.u3586.Node55HasAskedItsLeafSetToLxToReplaceNode7<1)||(u4221.LeafSetOfLxIsSentToNode55<1))")U(("((i39.u34.Node24DontAnswerToAnyNode<1)||(i24.i0.i12.u3964.Node61IsActive<1))")||(G("((i69.u3586.Node55HasAskedItsLeafSetToLxToReplaceNode7<1)||(u4221.LeafSetOfLxIsSentToNode55<1))"))))))&&("((i69.u3586.Node55HasAskedItsLeafSetToLxToReplaceNode7<1)||(u4221.LeafSetOfLxIsSentToNode55<1))")))U(G("((i48.u1510.NoNodeManageTheBreakDownOfNode53<1)||(i48.u3761.Node57WantsToManageTheBreakDownOfNode53<1))"))))
Formula 0 simplified : !((G("((i69.u3586.Node55HasAskedItsLeafSetToLxToReplaceNode7<1)||(u4221.LeafSetOfLxIsSentToNode55<1))" & X("((i69.u3586.Node55HasAskedItsLeafSetToLxToReplaceNode7<1)||(u4221.LeafSetOfLxIsSentToNode55<1))" U ("((i39.u34.Node24DontAnswerToAnyNode<1)||(i24.i0.i12.u3964.Node61IsActive<1))" | G"((i69.u3586.Node55HasAskedItsLeafSetToLxToReplaceNode7<1)||(u4221.LeafSetOfLxIsSentToNode55<1))"))) | ("((i69.u3586.Node55HasAskedItsLeafSetToLxToReplaceNode7<1)||(u4221.LeafSetOfLxIsSentToNode55<1))" & X(("((i69.u3586.Node55HasAskedItsLeafSetToLxToReplaceNode7<1)||(u4221.LeafSetOfLxIsSentToNode55<1))" U ("((i39.u34.Node24DontAnswerToAnyNode<1)||(i24.i0.i12.u3964.Node61IsActive<1))" | G"((i69.u3586.Node55HasAskedItsLeafSetToLxToReplaceNode7<1)||(u4221.LeafSetOfLxIsSentToNode55<1))")) & GF("(u4222.Node44HasTheLeafSetOfRxToReplaceNode61<1)" U ("(((i69.u3586.Node55HasAskedItsLeafSetToLxToReplaceNode7<1)||(u4221.LeafSetOfLxIsSentToNode55<1))&&(u4222.Node44HasTheLeafSetOfRxToReplaceNode61<1))" | G"(u4222.Node44HasTheLeafSetOfRxToReplaceNode61<1)"))))) U G"((i48.u1510.NoNodeManageTheBreakDownOfNode53<1)||(i48.u3761.Node57WantsToManageTheBreakDownOfNode53<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5099012552165124186
[2021-05-18 06:17:22] [INFO ] Built C files in 281ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5099012552165124186
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5099012552165124186]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5099012552165124186] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5099012552165124186] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property LeafsetExtension-PT-S64C4-01 finished in 93540 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U G(!p0))&&X(G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 17233 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 78 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
// Phase 1: matrix 21129 rows 17233 cols
[2021-05-18 06:17:25] [INFO ] Computed 198 place invariants in 2366 ms
[2021-05-18 06:17:27] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 06:17:27] [INFO ] Implicit Places using invariants in 3890 ms returned []
Implicit Place search using SMT only with invariants took 3891 ms to find 0 implicit places.
// Phase 1: matrix 21129 rows 17233 cols
[2021-05-18 06:17:30] [INFO ] Computed 198 place invariants in 2667 ms
[2021-05-18 06:17:31] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 06:17:31] [INFO ] Dead Transitions using invariants and state equation in 4240 ms returned []
Finished structural reductions, in 1 iterations. Remains : 17233/17233 places, 21129/21129 transitions.
Stuttering acceptance computed with spot in 7860 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Running random walk in product with property : LeafsetExtension-PT-S64C4-02 automaton TGBA [mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(OR p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(LT s12338 1), p1:(OR (AND (GEQ s6069 1) (GEQ s6308 1)) (GEQ s12338 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA LeafsetExtension-PT-S64C4-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S64C4-02 finished in 16139 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(G((F(p1)||p0))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 17233 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 68 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
// Phase 1: matrix 21129 rows 17233 cols
[2021-05-18 06:17:41] [INFO ] Computed 198 place invariants in 2421 ms
[2021-05-18 06:17:43] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 06:17:43] [INFO ] Implicit Places using invariants in 4008 ms returned []
Implicit Place search using SMT only with invariants took 4009 ms to find 0 implicit places.
// Phase 1: matrix 21129 rows 17233 cols
[2021-05-18 06:17:46] [INFO ] Computed 198 place invariants in 2541 ms
[2021-05-18 06:17:47] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 06:17:47] [INFO ] Dead Transitions using invariants and state equation in 4077 ms returned []
Finished structural reductions, in 1 iterations. Remains : 17233/17233 places, 21129/21129 transitions.
Stuttering acceptance computed with spot in 3535 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : LeafsetExtension-PT-S64C4-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s1052 1) (LT s1066 1)), p1:(OR (LT s1052 1) (LT s1066 1) (LT s11936 1) (LT s12095 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 3010 reset in 2332 ms.
Product exploration explored 100000 steps with 3011 reset in 2126 ms.
Graph (complete) has 42513 edges and 17233 vertex of which 8649 are kept as prefixes of interest. Removing 8584 places using SCC suffix rule.21 ms
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 312 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 3018 reset in 2140 ms.
Product exploration explored 100000 steps with 3015 reset in 2237 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 4862 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 17233 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Performed 8319 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8319 rules applied. Total rules applied 8319 place count 17233 transition count 21129
Performed 129 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 129 Pre rules applied. Total rules applied 8319 place count 17233 transition count 25128
Deduced a syphon composed of 8448 places in 13 ms
Iterating global reduction 1 with 129 rules applied. Total rules applied 8448 place count 17233 transition count 25128
Discarding 3999 places :
Symmetric choice reduction at 1 with 3999 rule applications. Total rules 12447 place count 13234 transition count 17130
Deduced a syphon composed of 8448 places in 6 ms
Iterating global reduction 1 with 3999 rules applied. Total rules applied 16446 place count 13234 transition count 17130
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8450 places in 6 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 16448 place count 13234 transition count 17130
Deduced a syphon composed of 8450 places in 7 ms
Applied a total of 16448 rules in 4091 ms. Remains 13234 /17233 variables (removed 3999) and now considering 17130/21129 (removed 3999) transitions.
// Phase 1: matrix 17130 rows 13234 cols
[2021-05-18 06:18:10] [INFO ] Computed 198 place invariants in 618 ms
[2021-05-18 06:18:11] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 06:18:11] [INFO ] Dead Transitions using invariants and state equation in 1784 ms returned []
Finished structural reductions, in 1 iterations. Remains : 13234/17233 places, 17130/21129 transitions.
Product exploration explored 100000 steps with 4717 reset in 8853 ms.
Product exploration explored 100000 steps with 4705 reset in 8466 ms.
[2021-05-18 06:18:29] [INFO ] Flatten gal took : 672 ms
[2021-05-18 06:18:30] [INFO ] Flatten gal took : 690 ms
[2021-05-18 06:18:32] [INFO ] Time to serialize gal into /tmp/LTL3508244172000928530.gal : 2449 ms
[2021-05-18 06:18:32] [INFO ] Time to serialize properties into /tmp/LTL13802642952887447131.ltl : 4 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL3508244172000928530.gal, -t, CGAL, -LTL, /tmp/LTL13802642952887447131.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3508244172000928530.gal -t CGAL -LTL /tmp/LTL13802642952887447131.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X(G(("((NoNodeManageTheBreakDownOfNode3<1)||(Node4WantsToManageTheBreakDownOfNode3<1))")||(F("((((NoNodeManageTheBreakDownOfNode3<1)||(Node4WantsToManageTheBreakDownOfNode3<1))||(Node45HasAskedItsLeafSetToLxToReplaceNode24<1))||(LeafSetOfLxIsSentToNode45<1))"))))))))
Formula 0 simplified : !XXXG("((NoNodeManageTheBreakDownOfNode3<1)||(Node4WantsToManageTheBreakDownOfNode3<1))" | F"((((NoNodeManageTheBreakDownOfNode3<1)||(Node4WantsToManageTheBreakDownOfNode3<1))||(Node45HasAskedItsLeafSetToLxToReplaceNode24<1))||(LeafSetOfLxIsSentToNode45<1))")
Detected timeout of ITS tools.
[2021-05-18 06:18:48] [INFO ] Flatten gal took : 580 ms
[2021-05-18 06:18:48] [INFO ] Applying decomposition
[2021-05-18 06:18:49] [INFO ] Flatten gal took : 660 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph10727862742336558950.txt, -o, /tmp/graph10727862742336558950.bin, -w, /tmp/graph10727862742336558950.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph10727862742336558950.bin, -l, -1, -v, -w, /tmp/graph10727862742336558950.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 06:18:50] [INFO ] Decomposing Gal with order
[2021-05-18 06:18:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 06:19:18] [INFO ] Removed a total of 16050 redundant transitions.
[2021-05-18 06:19:18] [INFO ] Flatten gal took : 7049 ms
[2021-05-18 06:19:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 182 labels/synchronizations in 198 ms.
[2021-05-18 06:19:19] [INFO ] Time to serialize gal into /tmp/LTL8706358147313939509.gal : 217 ms
[2021-05-18 06:19:19] [INFO ] Time to serialize properties into /tmp/LTL2352279256063299242.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL8706358147313939509.gal, -t, CGAL, -LTL, /tmp/LTL2352279256063299242.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8706358147313939509.gal -t CGAL -LTL /tmp/LTL2352279256063299242.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(X(G(("((i46.i0.u1140.NoNodeManageTheBreakDownOfNode3<1)||(i4.i1.u293.Node4WantsToManageTheBreakDownOfNode3<1))")||(F("((((i46.i0.u1140.NoNodeManageTheBreakDownOfNode3<1)||(i4.i1.u293.Node4WantsToManageTheBreakDownOfNode3<1))||(i69.u2960.Node45HasAskedItsLeafSetToLxToReplaceNode24<1))||(u4221.LeafSetOfLxIsSentToNode45<1))"))))))))
Formula 0 simplified : !XXXG("((i46.i0.u1140.NoNodeManageTheBreakDownOfNode3<1)||(i4.i1.u293.Node4WantsToManageTheBreakDownOfNode3<1))" | F"((((i46.i0.u1140.NoNodeManageTheBreakDownOfNode3<1)||(i4.i1.u293.Node4WantsToManageTheBreakDownOfNode3<1))||(i69.u2960.Node45HasAskedItsLeafSetToLxToReplaceNode24<1))||(u4221.LeafSetOfLxIsSentToNode45<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9220623742157875593
[2021-05-18 06:19:34] [INFO ] Built C files in 185ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9220623742157875593
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin9220623742157875593]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin9220623742157875593] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin9220623742157875593] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property LeafsetExtension-PT-S64C4-03 finished in 116144 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(G(p0))&&F(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 17233 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 297 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
// Phase 1: matrix 21129 rows 17233 cols
[2021-05-18 06:19:38] [INFO ] Computed 198 place invariants in 2425 ms
[2021-05-18 06:19:39] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 06:19:39] [INFO ] Implicit Places using invariants in 3638 ms returned []
Implicit Place search using SMT only with invariants took 3652 ms to find 0 implicit places.
// Phase 1: matrix 21129 rows 17233 cols
[2021-05-18 06:19:42] [INFO ] Computed 198 place invariants in 2804 ms
[2021-05-18 06:19:44] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 06:19:44] [INFO ] Dead Transitions using invariants and state equation in 5206 ms returned []
Finished structural reductions, in 1 iterations. Remains : 17233/17233 places, 21129/21129 transitions.
Stuttering acceptance computed with spot in 183 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : LeafsetExtension-PT-S64C4-04 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GEQ s12888 1) (GEQ s15975 1)), p1:(GEQ s11431 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA LeafsetExtension-PT-S64C4-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S64C4-04 finished in 9451 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(F(p0)) U G(p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 17233 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Drop transitions removed 8223 transitions
Trivial Post-agglo rules discarded 8223 transitions
Performed 8223 trivial Post agglomeration. Transition count delta: 8223
Iterating post reduction 0 with 8223 rules applied. Total rules applied 8223 place count 17233 transition count 12906
Reduce places removed 8223 places and 0 transitions.
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Iterating post reduction 1 with 8319 rules applied. Total rules applied 16542 place count 9010 transition count 12810
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 2 with 96 rules applied. Total rules applied 16638 place count 8914 transition count 12810
Performed 129 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 129 Pre rules applied. Total rules applied 16638 place count 8914 transition count 12681
Deduced a syphon composed of 129 places in 5 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 258 rules applied. Total rules applied 16896 place count 8785 transition count 12681
Discarding 4030 places :
Symmetric choice reduction at 3 with 4030 rule applications. Total rules 20926 place count 4755 transition count 8651
Iterating global reduction 3 with 4030 rules applied. Total rules applied 24956 place count 4755 transition count 8651
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 24956 place count 4755 transition count 8650
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24958 place count 4754 transition count 8650
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24960 place count 4753 transition count 8649
Applied a total of 24960 rules in 3251 ms. Remains 4753 /17233 variables (removed 12480) and now considering 8649/21129 (removed 12480) transitions.
// Phase 1: matrix 8649 rows 4753 cols
[2021-05-18 06:19:48] [INFO ] Computed 198 place invariants in 101 ms
[2021-05-18 06:19:48] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 06:19:52] [INFO ] Implicit Places using invariants in 3629 ms returned [642, 1210, 2557, 2702, 3945]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 3640 ms to find 5 implicit places.
[2021-05-18 06:19:53] [INFO ] Redundant transitions in 1223 ms returned []
// Phase 1: matrix 8649 rows 4748 cols
[2021-05-18 06:19:53] [INFO ] Computed 193 place invariants in 103 ms
[2021-05-18 06:19:53] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 06:19:58] [INFO ] Dead Transitions using invariants and state equation in 4948 ms returned []
Starting structural reductions, iteration 1 : 4748/17233 places, 8649/21129 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 4746 transition count 8647
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 4746 transition count 8647
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 4744 transition count 8645
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 4744 transition count 8645
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 49 place count 4703 transition count 8604
Iterating global reduction 0 with 41 rules applied. Total rules applied 90 place count 4703 transition count 8604
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 2 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 0 with 130 rules applied. Total rules applied 220 place count 4638 transition count 8539
Applied a total of 220 rules in 3020 ms. Remains 4638 /4748 variables (removed 110) and now considering 8539/8649 (removed 110) transitions.
[2021-05-18 06:20:01] [INFO ] Flow matrix only has 8498 transitions (discarded 41 similar events)
// Phase 1: matrix 8498 rows 4638 cols
[2021-05-18 06:20:01] [INFO ] Computed 193 place invariants in 148 ms
[2021-05-18 06:20:02] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 06:20:05] [INFO ] Implicit Places using invariants in 4096 ms returned [316, 1723, 3214, 4123, 4333]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 4114 ms to find 5 implicit places.
Starting structural reductions, iteration 2 : 4633/17233 places, 8539/21129 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 4629 transition count 8535
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 4629 transition count 8535
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 4626 transition count 8532
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 4626 transition count 8532
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 78 place count 4562 transition count 8468
Iterating global reduction 0 with 64 rules applied. Total rules applied 142 place count 4562 transition count 8468
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 2 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 0 with 126 rules applied. Total rules applied 268 place count 4499 transition count 8405
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 269 place count 4498 transition count 8404
Iterating global reduction 0 with 1 rules applied. Total rules applied 270 place count 4498 transition count 8404
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 301 place count 4467 transition count 8373
Iterating global reduction 0 with 31 rules applied. Total rules applied 332 place count 4467 transition count 8373
Applied a total of 332 rules in 3967 ms. Remains 4467 /4633 variables (removed 166) and now considering 8373/8539 (removed 166) transitions.
[2021-05-18 06:20:09] [INFO ] Flow matrix only has 8232 transitions (discarded 141 similar events)
// Phase 1: matrix 8232 rows 4467 cols
[2021-05-18 06:20:09] [INFO ] Computed 188 place invariants in 95 ms
[2021-05-18 06:20:13] [INFO ] Implicit Places using invariants in 4261 ms returned [760, 1068, 1356, 3457, 3847]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 4269 ms to find 5 implicit places.
Starting structural reductions, iteration 3 : 4462/17233 places, 8373/21129 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 4399 transition count 8310
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 4399 transition count 8310
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 128 place count 4397 transition count 8308
Iterating global reduction 0 with 2 rules applied. Total rules applied 130 place count 4397 transition count 8308
Discarding 62 places :
Symmetric choice reduction at 0 with 62 rule applications. Total rules 192 place count 4335 transition count 8246
Iterating global reduction 0 with 62 rules applied. Total rules applied 254 place count 4335 transition count 8246
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 2 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 0 with 124 rules applied. Total rules applied 378 place count 4273 transition count 8184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 379 place count 4272 transition count 8183
Iterating global reduction 0 with 1 rules applied. Total rules applied 380 place count 4272 transition count 8183
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 409 place count 4243 transition count 8154
Iterating global reduction 0 with 29 rules applied. Total rules applied 438 place count 4243 transition count 8154
Applied a total of 438 rules in 3455 ms. Remains 4243 /4462 variables (removed 219) and now considering 8154/8373 (removed 219) transitions.
[2021-05-18 06:20:17] [INFO ] Flow matrix only has 7915 transitions (discarded 239 similar events)
// Phase 1: matrix 7915 rows 4243 cols
[2021-05-18 06:20:17] [INFO ] Computed 183 place invariants in 83 ms
[2021-05-18 06:20:17] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 06:20:20] [INFO ] Implicit Places using invariants in 3069 ms returned [806, 2440, 3263, 3496, 3531]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 3076 ms to find 5 implicit places.
Starting structural reductions, iteration 4 : 4238/17233 places, 8154/21129 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 4234 transition count 8150
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 4234 transition count 8150
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 4230 transition count 8146
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 4230 transition count 8146
Discarding 100 places :
Symmetric choice reduction at 0 with 100 rule applications. Total rules 116 place count 4130 transition count 8046
Iterating global reduction 0 with 100 rules applied. Total rules applied 216 place count 4130 transition count 8046
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 218 place count 4129 transition count 8045
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 219 place count 4128 transition count 8044
Iterating global reduction 0 with 1 rules applied. Total rules applied 220 place count 4128 transition count 8044
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 269 place count 4079 transition count 7995
Iterating global reduction 0 with 49 rules applied. Total rules applied 318 place count 4079 transition count 7995
Applied a total of 318 rules in 3110 ms. Remains 4079 /4238 variables (removed 159) and now considering 7995/8154 (removed 159) transitions.
[2021-05-18 06:20:23] [INFO ] Flow matrix only has 7596 transitions (discarded 399 similar events)
// Phase 1: matrix 7596 rows 4079 cols
[2021-05-18 06:20:23] [INFO ] Computed 178 place invariants in 133 ms
[2021-05-18 06:20:28] [INFO ] Implicit Places using invariants in 5439 ms returned [3, 35, 67, 70, 102, 134, 137, 169, 201, 204, 236, 268, 271, 334, 337, 369, 401, 404, 436, 468, 471, 503, 535, 538, 570, 602, 636, 668, 671, 703, 735, 740, 771, 774, 807, 810, 842, 874, 877, 909, 941, 944, 977, 980, 1012, 1044, 1053, 1084, 1087, 1119, 1151, 1154, 1186, 1218, 1224, 1255, 1258, 1290, 1325, 1357, 1389, 1392, 1424, 1456, 1459, 1492, 1526, 1558, 1590, 1593, 1625, 1657, 1660, 1692, 1724, 1727, 1759, 1791, 1794, 1826, 1858, 1861, 1893, 1925, 1928, 1960, 1992, 1994, 1996, 2028, 2060, 2063, 2095, 2127, 2130, 2162, 2194, 2197, 2229, 2264, 2296, 2328, 2331, 2363, 2395, 2414, 2417, 2449, 2481, 2484, 2516, 2548, 2551, 2583, 2615, 2618, 2685, 2688, 2720, 2752, 2755, 2787, 2819, 2822, 2854, 2886, 2889, 2930, 2933, 2965, 2997, 3000, 3032, 3064, 3067, 3099, 3131, 3134, 3166, 3201, 3232, 3235, 3267, 3299, 3302, 3334, 3366, 3369, 3409, 3413, 3416, 3448, 3483, 3515, 3547, 3550, 3582, 3614, 3617, 3653, 3656, 3688, 3720, 3723, 3755, 3787, 3790, 3826, 3829, 3861, 3893, 3896, 3928, 3960]
Discarding 174 places :
Implicit Place search using SMT only with invariants took 5449 ms to find 174 implicit places.
Starting structural reductions, iteration 5 : 3905/17233 places, 7995/21129 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 3905 transition count 7994
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3904 transition count 7994
Discarding 3471 places :
Symmetric choice reduction at 0 with 3471 rule applications. Total rules 3473 place count 433 transition count 4523
Iterating global reduction 0 with 3471 rules applied. Total rules applied 6944 place count 433 transition count 4523
Discarding 112 places :
Symmetric choice reduction at 0 with 112 rule applications. Total rules 7056 place count 321 transition count 4411
Iterating global reduction 0 with 112 rules applied. Total rules applied 7168 place count 321 transition count 4411
Discarding 168 places :
Symmetric choice reduction at 0 with 168 rule applications. Total rules 7336 place count 153 transition count 4243
Iterating global reduction 0 with 168 rules applied. Total rules applied 7504 place count 153 transition count 4243
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 7514 place count 148 transition count 4238
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7515 place count 147 transition count 4237
Iterating global reduction 0 with 1 rules applied. Total rules applied 7516 place count 147 transition count 4237
Applied a total of 7516 rules in 224 ms. Remains 147 /3905 variables (removed 3758) and now considering 4237/7995 (removed 3758) transitions.
[2021-05-18 06:20:28] [INFO ] Flow matrix only has 177 transitions (discarded 4060 similar events)
// Phase 1: matrix 177 rows 147 cols
[2021-05-18 06:20:28] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-18 06:20:29] [INFO ] Implicit Places using invariants in 240 ms returned []
[2021-05-18 06:20:29] [INFO ] Flow matrix only has 177 transitions (discarded 4060 similar events)
// Phase 1: matrix 177 rows 147 cols
[2021-05-18 06:20:29] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-18 06:20:29] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 653 ms to find 0 implicit places.
Finished structural reductions, in 6 iterations. Remains : 147/17233 places, 4237/21129 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : LeafsetExtension-PT-S64C4-05 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s93 1) (GEQ s95 1)), p0:(AND (GEQ s48 1) (GEQ s110 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 24 steps with 2 reset in 0 ms.
FORMULA LeafsetExtension-PT-S64C4-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S64C4-05 finished in 44551 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 17233 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 73 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
// Phase 1: matrix 21129 rows 17233 cols
[2021-05-18 06:20:32] [INFO ] Computed 198 place invariants in 2391 ms
[2021-05-18 06:20:34] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 06:20:34] [INFO ] Implicit Places using invariants in 4410 ms returned []
Implicit Place search using SMT only with invariants took 4412 ms to find 0 implicit places.
// Phase 1: matrix 21129 rows 17233 cols
[2021-05-18 06:20:36] [INFO ] Computed 198 place invariants in 2589 ms
[2021-05-18 06:20:38] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 06:20:38] [INFO ] Dead Transitions using invariants and state equation in 4192 ms returned []
Finished structural reductions, in 1 iterations. Remains : 17233/17233 places, 21129/21129 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S64C4-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LT s6367 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 63553 steps with 1913 reset in 1282 ms.
FORMULA LeafsetExtension-PT-S64C4-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S64C4-06 finished in 10118 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 17233 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Drop transitions removed 8319 transitions
Trivial Post-agglo rules discarded 8319 transitions
Performed 8319 trivial Post agglomeration. Transition count delta: 8319
Iterating post reduction 0 with 8319 rules applied. Total rules applied 8319 place count 17233 transition count 12810
Reduce places removed 8319 places and 0 transitions.
Iterating post reduction 1 with 8319 rules applied. Total rules applied 16638 place count 8914 transition count 12810
Performed 130 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 130 Pre rules applied. Total rules applied 16638 place count 8914 transition count 12680
Deduced a syphon composed of 130 places in 6 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 2 with 260 rules applied. Total rules applied 16898 place count 8784 transition count 12680
Discarding 4030 places :
Symmetric choice reduction at 2 with 4030 rule applications. Total rules 20928 place count 4754 transition count 8650
Iterating global reduction 2 with 4030 rules applied. Total rules applied 24958 place count 4754 transition count 8650
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 24958 place count 4754 transition count 8649
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24960 place count 4753 transition count 8649
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24962 place count 4752 transition count 8648
Applied a total of 24962 rules in 2731 ms. Remains 4752 /17233 variables (removed 12481) and now considering 8648/21129 (removed 12481) transitions.
// Phase 1: matrix 8648 rows 4752 cols
[2021-05-18 06:20:42] [INFO ] Computed 198 place invariants in 102 ms
[2021-05-18 06:20:43] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 06:20:46] [INFO ] Implicit Places using invariants in 3649 ms returned [391, 2417, 3343, 3553, 3660]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 3659 ms to find 5 implicit places.
[2021-05-18 06:20:47] [INFO ] Redundant transitions in 1131 ms returned []
// Phase 1: matrix 8648 rows 4747 cols
[2021-05-18 06:20:47] [INFO ] Computed 193 place invariants in 102 ms
[2021-05-18 06:20:47] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 06:20:52] [INFO ] Dead Transitions using invariants and state equation in 5083 ms returned []
Starting structural reductions, iteration 1 : 4747/17233 places, 8648/21129 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 4683 transition count 8584
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 4683 transition count 8584
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 129 place count 4682 transition count 8583
Iterating global reduction 0 with 1 rules applied. Total rules applied 130 place count 4682 transition count 8583
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 144 place count 4668 transition count 8569
Iterating global reduction 0 with 14 rules applied. Total rules applied 158 place count 4668 transition count 8569
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 2 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 0 with 130 rules applied. Total rules applied 288 place count 4603 transition count 8504
Applied a total of 288 rules in 2922 ms. Remains 4603 /4747 variables (removed 144) and now considering 8504/8648 (removed 144) transitions.
[2021-05-18 06:20:55] [INFO ] Flow matrix only has 8489 transitions (discarded 15 similar events)
// Phase 1: matrix 8489 rows 4603 cols
[2021-05-18 06:20:55] [INFO ] Computed 193 place invariants in 100 ms
[2021-05-18 06:20:56] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 06:20:59] [INFO ] Implicit Places using invariants in 3868 ms returned [413, 1241, 1796, 2000, 4336]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 3874 ms to find 5 implicit places.
Starting structural reductions, iteration 2 : 4598/17233 places, 8504/21129 transitions.
Discarding 129 places :
Symmetric choice reduction at 0 with 129 rule applications. Total rules 129 place count 4469 transition count 8375
Iterating global reduction 0 with 129 rules applied. Total rules applied 258 place count 4469 transition count 8375
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 260 place count 4467 transition count 8373
Iterating global reduction 0 with 2 rules applied. Total rules applied 262 place count 4467 transition count 8373
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 317 place count 4412 transition count 8318
Iterating global reduction 0 with 55 rules applied. Total rules applied 372 place count 4412 transition count 8318
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 0 with 126 rules applied. Total rules applied 498 place count 4349 transition count 8255
Applied a total of 498 rules in 2667 ms. Remains 4349 /4598 variables (removed 249) and now considering 8255/8504 (removed 249) transitions.
[2021-05-18 06:21:01] [INFO ] Flow matrix only has 8181 transitions (discarded 74 similar events)
// Phase 1: matrix 8181 rows 4349 cols
[2021-05-18 06:21:01] [INFO ] Computed 188 place invariants in 89 ms
[2021-05-18 06:21:02] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 06:21:05] [INFO ] Implicit Places using invariants in 3288 ms returned [230, 1021, 1652, 3461, 3821]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 3295 ms to find 5 implicit places.
Starting structural reductions, iteration 3 : 4344/17233 places, 8255/21129 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 4340 transition count 8251
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 4340 transition count 8251
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 4336 transition count 8247
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 4336 transition count 8247
Discarding 93 places :
Symmetric choice reduction at 0 with 93 rule applications. Total rules 109 place count 4243 transition count 8154
Iterating global reduction 0 with 93 rules applied. Total rules applied 202 place count 4243 transition count 8154
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 204 place count 4242 transition count 8153
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 205 place count 4241 transition count 8152
Iterating global reduction 0 with 1 rules applied. Total rules applied 206 place count 4241 transition count 8152
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 253 place count 4194 transition count 8105
Iterating global reduction 0 with 47 rules applied. Total rules applied 300 place count 4194 transition count 8105
Applied a total of 300 rules in 3240 ms. Remains 4194 /4344 variables (removed 150) and now considering 8105/8255 (removed 150) transitions.
[2021-05-18 06:21:08] [INFO ] Flow matrix only has 7879 transitions (discarded 226 similar events)
// Phase 1: matrix 7879 rows 4194 cols
[2021-05-18 06:21:08] [INFO ] Computed 183 place invariants in 84 ms
[2021-05-18 06:21:13] [INFO ] Implicit Places using invariants in 5416 ms returned [3, 32, 66, 69, 98, 132, 135, 164, 198, 201, 263, 266, 295, 329, 332, 366, 395, 429, 432, 461, 495, 498, 527, 561, 564, 593, 627, 630, 659, 693, 696, 725, 759, 762, 791, 825, 828, 857, 891, 894, 923, 957, 960, 991, 994, 1023, 1057, 1060, 1090, 1126, 1155, 1189, 1192, 1221, 1255, 1258, 1287, 1321, 1324, 1353, 1387, 1390, 1419, 1453, 1456, 1485, 1519, 1522, 1551, 1585, 1616, 1650, 1653, 1686, 1689, 1718, 1752, 1755, 1785, 1821, 1850, 1884, 1887, 1916, 1950, 1953, 1982, 2016, 2018, 2020, 2049, 2083, 2086, 2154, 2184, 2217, 2220, 2250, 2283, 2286, 2316, 2349, 2352, 2382, 2415, 2418, 2448, 2481, 2484, 2514, 2547, 2550, 2580, 2613, 2616, 2646, 2679, 2682, 2712, 2745, 2748, 2778, 2811, 2814, 2844, 2877, 2880, 2910, 2943, 2946, 2976, 3009, 3017, 3049, 3052, 3082, 3115, 3118, 3148, 3184, 3214, 3247, 3250, 3298, 3301, 3331, 3364, 3367, 3399, 3402, 3432, 3465, 3468, 3498, 3531, 3534, 3564, 3597, 3600, 3630, 3663, 3666, 3704, 3707, 3737, 3770, 3773, 3803, 3836, 3839, 3869, 3902, 3905, 3935, 3968, 3971, 4003, 4006, 4036, 4069]
Discarding 180 places :
Implicit Place search using SMT only with invariants took 5427 ms to find 180 implicit places.
Starting structural reductions, iteration 4 : 4014/17233 places, 8105/21129 transitions.
Discarding 3629 places :
Symmetric choice reduction at 0 with 3629 rule applications. Total rules 3629 place count 385 transition count 4476
Iterating global reduction 0 with 3629 rules applied. Total rules applied 7258 place count 385 transition count 4476
Discarding 118 places :
Symmetric choice reduction at 0 with 118 rule applications. Total rules 7376 place count 267 transition count 4358
Iterating global reduction 0 with 118 rules applied. Total rules applied 7494 place count 267 transition count 4358
Discarding 118 places :
Symmetric choice reduction at 0 with 118 rule applications. Total rules 7612 place count 149 transition count 4240
Iterating global reduction 0 with 118 rules applied. Total rules applied 7730 place count 149 transition count 4240
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 7742 place count 143 transition count 4234
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7743 place count 142 transition count 4233
Iterating global reduction 0 with 1 rules applied. Total rules applied 7744 place count 142 transition count 4233
Applied a total of 7744 rules in 217 ms. Remains 142 /4014 variables (removed 3872) and now considering 4233/8105 (removed 3872) transitions.
[2021-05-18 06:21:14] [INFO ] Flow matrix only has 171 transitions (discarded 4062 similar events)
// Phase 1: matrix 171 rows 142 cols
[2021-05-18 06:21:14] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-18 06:21:14] [INFO ] Implicit Places using invariants in 234 ms returned []
[2021-05-18 06:21:14] [INFO ] Flow matrix only has 171 transitions (discarded 4062 similar events)
// Phase 1: matrix 171 rows 142 cols
[2021-05-18 06:21:14] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-18 06:21:14] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 622 ms to find 0 implicit places.
Finished structural reductions, in 5 iterations. Remains : 142/17233 places, 4233/21129 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S64C4-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s72 1) (OR (LT s33 1) (LT s36 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 13 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S64C4-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S64C4-07 finished in 34933 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(G(p0)))))], workingDir=/home/mcc/execution]
Support contains 1 out of 17233 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 98 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
// Phase 1: matrix 21129 rows 17233 cols
[2021-05-18 06:21:17] [INFO ] Computed 198 place invariants in 2491 ms
[2021-05-18 06:21:18] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 06:21:18] [INFO ] Implicit Places using invariants in 4030 ms returned []
Implicit Place search using SMT only with invariants took 4031 ms to find 0 implicit places.
// Phase 1: matrix 21129 rows 17233 cols
[2021-05-18 06:21:21] [INFO ] Computed 198 place invariants in 2546 ms
[2021-05-18 06:21:22] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 06:21:22] [INFO ] Dead Transitions using invariants and state equation in 4129 ms returned []
Finished structural reductions, in 1 iterations. Remains : 17233/17233 places, 21129/21129 transitions.
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S64C4-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(LT s2849 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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 16000 steps with 482 reset in 258 ms.
FORMULA LeafsetExtension-PT-S64C4-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S64C4-08 finished in 8680 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((X((p0||X((p1&&X(p2)))))||(p0 U (p3||G(p0)))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 17233 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 68 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
// Phase 1: matrix 21129 rows 17233 cols
[2021-05-18 06:21:25] [INFO ] Computed 198 place invariants in 2399 ms
[2021-05-18 06:21:27] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 06:21:27] [INFO ] Implicit Places using invariants in 4187 ms returned []
Implicit Place search using SMT only with invariants took 4187 ms to find 0 implicit places.
// Phase 1: matrix 21129 rows 17233 cols
[2021-05-18 06:21:30] [INFO ] Computed 198 place invariants in 2681 ms
[2021-05-18 06:21:32] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 06:21:32] [INFO ] Dead Transitions using invariants and state equation in 5195 ms returned []
Finished structural reductions, in 1 iterations. Remains : 17233/17233 places, 21129/21129 transitions.
Stuttering acceptance computed with spot in 214 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Running random walk in product with property : LeafsetExtension-PT-S64C4-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p3), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p3) (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p3) (NOT p0) p1), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p3:(AND (LT s9777 1) (LT s14740 1)), p0:(LT s9777 1), p1:(OR (LT s7101 1) (LT s12994 1)), p2:(OR (LT s14757 1) (LT s14988 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 66420 steps with 33210 reset in 10001 ms.
Product exploration timeout after 63900 steps with 31950 reset in 10001 ms.
Graph (complete) has 42513 edges and 17233 vertex of which 8649 are kept as prefixes of interest. Removing 8584 places using SCC suffix rule.20 ms
Knowledge obtained : [p3, p0, p1, p2]
Stuttering acceptance computed with spot in 169 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Product exploration timeout after 68350 steps with 34175 reset in 10001 ms.
Product exploration timeout after 68830 steps with 34415 reset in 10001 ms.
[2021-05-18 06:22:14] [INFO ] Flatten gal took : 841 ms
[2021-05-18 06:22:15] [INFO ] Flatten gal took : 828 ms
[2021-05-18 06:22:15] [INFO ] Time to serialize gal into /tmp/LTL12228049206932937307.gal : 229 ms
[2021-05-18 06:22:15] [INFO ] Time to serialize properties into /tmp/LTL16567008583885489656.ltl : 6 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL12228049206932937307.gal, -t, CGAL, -LTL, /tmp/LTL16567008583885489656.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL12228049206932937307.gal -t CGAL -LTL /tmp/LTL16567008583885489656.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F((X(("(Node37HasTheLeafSetOfLxToReplaceNode10<1)")||(X(("((NoNodeManageTheBreakDownOfNode26<1)||(Node49WantsToManageTheBreakDownOfNode26<1))")&&(X("((Node56HasAskedItsLeafSetToLxToReplaceNode6<1)||(LeafSetOfLxIsSentToNode56<1))"))))))||(("(Node37HasTheLeafSetOfLxToReplaceNode10<1)")U(("((Node37HasTheLeafSetOfLxToReplaceNode10<1)&&(Node56ManageTheBreakDownOfNode2<1))")||(G("(Node37HasTheLeafSetOfLxToReplaceNode10<1)"))))))))
Formula 0 simplified : !XF(X("(Node37HasTheLeafSetOfLxToReplaceNode10<1)" | X("((NoNodeManageTheBreakDownOfNode26<1)||(Node49WantsToManageTheBreakDownOfNode26<1))" & X"((Node56HasAskedItsLeafSetToLxToReplaceNode6<1)||(LeafSetOfLxIsSentToNode56<1))")) | ("(Node37HasTheLeafSetOfLxToReplaceNode10<1)" U ("((Node37HasTheLeafSetOfLxToReplaceNode10<1)&&(Node56ManageTheBreakDownOfNode2<1))" | G"(Node37HasTheLeafSetOfLxToReplaceNode10<1)")))
Detected timeout of ITS tools.
[2021-05-18 06:22:31] [INFO ] Flatten gal took : 667 ms
[2021-05-18 06:22:31] [INFO ] Applying decomposition
[2021-05-18 06:22:32] [INFO ] Flatten gal took : 695 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph3667383501121184703.txt, -o, /tmp/graph3667383501121184703.bin, -w, /tmp/graph3667383501121184703.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph3667383501121184703.bin, -l, -1, -v, -w, /tmp/graph3667383501121184703.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 06:22:33] [INFO ] Decomposing Gal with order
[2021-05-18 06:22:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 06:23:01] [INFO ] Removed a total of 16050 redundant transitions.
[2021-05-18 06:23:01] [INFO ] Flatten gal took : 7017 ms
[2021-05-18 06:23:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 231 labels/synchronizations in 268 ms.
[2021-05-18 06:23:02] [INFO ] Time to serialize gal into /tmp/LTL2324440238812856438.gal : 204 ms
[2021-05-18 06:23:02] [INFO ] Time to serialize properties into /tmp/LTL13420736303180317128.ltl : 60 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL2324440238812856438.gal, -t, CGAL, -LTL, /tmp/LTL13420736303180317128.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2324440238812856438.gal -t CGAL -LTL /tmp/LTL13420736303180317128.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F((X(("(u4222.Node37HasTheLeafSetOfLxToReplaceNode10<1)")||(X(("((i37.i0.u35.NoNodeManageTheBreakDownOfNode26<1)||(i69.u3218.Node49WantsToManageTheBreakDownOfNode26<1))")&&(X("((i4.i1.u3650.Node56HasAskedItsLeafSetToLxToReplaceNode6<1)||(u4222.LeafSetOfLxIsSentToNode56<1))"))))))||(("(u4222.Node37HasTheLeafSetOfLxToReplaceNode10<1)")U(("((u4222.Node37HasTheLeafSetOfLxToReplaceNode10<1)&&(i4.i1.u3646.Node56ManageTheBreakDownOfNode2<1))")||(G("(u4222.Node37HasTheLeafSetOfLxToReplaceNode10<1)"))))))))
Formula 0 simplified : !XF(X("(u4222.Node37HasTheLeafSetOfLxToReplaceNode10<1)" | X("((i37.i0.u35.NoNodeManageTheBreakDownOfNode26<1)||(i69.u3218.Node49WantsToManageTheBreakDownOfNode26<1))" & X"((i4.i1.u3650.Node56HasAskedItsLeafSetToLxToReplaceNode6<1)||(u4222.LeafSetOfLxIsSentToNode56<1))")) | ("(u4222.Node37HasTheLeafSetOfLxToReplaceNode10<1)" U ("((u4222.Node37HasTheLeafSetOfLxToReplaceNode10<1)&&(i4.i1.u3646.Node56ManageTheBreakDownOfNode2<1))" | G"(u4222.Node37HasTheLeafSetOfLxToReplaceNode10<1)")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3855081951250417513
[2021-05-18 06:23:17] [INFO ] Built C files in 177ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3855081951250417513
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin3855081951250417513]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin3855081951250417513] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin3855081951250417513] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property LeafsetExtension-PT-S64C4-09 finished in 115106 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(X(p0))&&F((p1 U (p2||G(p1))))&&(X(p0)||G(p3))))], workingDir=/home/mcc/execution]
Support contains 6 out of 17233 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 68 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
// Phase 1: matrix 21129 rows 17233 cols
[2021-05-18 06:23:20] [INFO ] Computed 198 place invariants in 2392 ms
[2021-05-18 06:23:22] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 06:23:22] [INFO ] Implicit Places using invariants in 3606 ms returned []
Implicit Place search using SMT only with invariants took 3607 ms to find 0 implicit places.
// Phase 1: matrix 21129 rows 17233 cols
[2021-05-18 06:23:24] [INFO ] Computed 198 place invariants in 2486 ms
[2021-05-18 06:23:25] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 06:23:25] [INFO ] Dead Transitions using invariants and state equation in 3705 ms returned []
Finished structural reductions, in 1 iterations. Remains : 17233/17233 places, 21129/21129 transitions.
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p0)), true, (NOT p3)]
Running random walk in product with property : LeafsetExtension-PT-S64C4-10 automaton TGBA [mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}, { cond=p3, acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND p3 (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p3), acceptance={} source=6 dest: 5}, { cond=p3, acceptance={} source=6 dest: 6}]], initial=0, aps=[p3:(AND (GEQ s8836 1) (GEQ s8941 1)), p2:(AND (OR (LT s8836 1) (LT s8941 1)) (OR (LT s3419 1) (LT s16094 1))), p0:(AND (GEQ s16642 1) (GEQ s16829 1)), p1:(OR (LT s3419 1) (LT s16094 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA LeafsetExtension-PT-S64C4-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S64C4-10 finished in 7604 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 17233 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 303 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
// Phase 1: matrix 21129 rows 17233 cols
[2021-05-18 06:23:28] [INFO ] Computed 198 place invariants in 2445 ms
[2021-05-18 06:23:29] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 06:23:30] [INFO ] Implicit Places using invariants in 3643 ms returned []
Implicit Place search using SMT only with invariants took 3644 ms to find 0 implicit places.
// Phase 1: matrix 21129 rows 17233 cols
[2021-05-18 06:23:32] [INFO ] Computed 198 place invariants in 2392 ms
[2021-05-18 06:23:33] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 06:23:33] [INFO ] Dead Transitions using invariants and state equation in 3609 ms returned []
Finished structural reductions, in 1 iterations. Remains : 17233/17233 places, 21129/21129 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S64C4-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s1685 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 2 ms.
FORMULA LeafsetExtension-PT-S64C4-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S64C4-12 finished in 7654 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 17233 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 79 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
// Phase 1: matrix 21129 rows 17233 cols
[2021-05-18 06:23:36] [INFO ] Computed 198 place invariants in 2818 ms
[2021-05-18 06:23:37] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 06:23:37] [INFO ] Implicit Places using invariants in 4022 ms returned []
Implicit Place search using SMT only with invariants took 4023 ms to find 0 implicit places.
// Phase 1: matrix 21129 rows 17233 cols
[2021-05-18 06:23:40] [INFO ] Computed 198 place invariants in 2752 ms
[2021-05-18 06:23:41] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 06:23:41] [INFO ] Dead Transitions using invariants and state equation in 3956 ms returned []
Finished structural reductions, in 1 iterations. Remains : 17233/17233 places, 21129/21129 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : LeafsetExtension-PT-S64C4-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s11976 1) (GEQ s12097 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, 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 2 ms.
FORMULA LeafsetExtension-PT-S64C4-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S64C4-14 finished in 8161 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((X((G(F(p1))||(p1 U p2)))&&p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 17233 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 99 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
// Phase 1: matrix 21129 rows 17233 cols
[2021-05-18 06:23:44] [INFO ] Computed 198 place invariants in 2441 ms
[2021-05-18 06:23:45] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 06:23:45] [INFO ] Implicit Places using invariants in 3647 ms returned []
Implicit Place search using SMT only with invariants took 3647 ms to find 0 implicit places.
// Phase 1: matrix 21129 rows 17233 cols
[2021-05-18 06:23:48] [INFO ] Computed 198 place invariants in 2510 ms
[2021-05-18 06:23:49] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 06:23:49] [INFO ] Dead Transitions using invariants and state equation in 3816 ms returned []
Finished structural reductions, in 1 iterations. Remains : 17233/17233 places, 21129/21129 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : LeafsetExtension-PT-S64C4-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s4452 1) (GEQ s4469 1)), p2:(AND (GEQ s4996 1) (GEQ s13152 1)), p1:(AND (GEQ s4452 1) (GEQ s4469 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 2 ms.
FORMULA LeafsetExtension-PT-S64C4-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S64C4-15 finished in 7773 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13350867985023248510
[2021-05-18 06:23:49] [INFO ] Too many transitions (21129) to apply POR reductions. Disabling POR matrices.
[2021-05-18 06:23:50] [INFO ] Built C files in 214ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13350867985023248510
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13350867985023248510]
[2021-05-18 06:23:50] [INFO ] Applying decomposition
[2021-05-18 06:23:51] [INFO ] Flatten gal took : 897 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph10754254781259729121.txt, -o, /tmp/graph10754254781259729121.bin, -w, /tmp/graph10754254781259729121.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph10754254781259729121.bin, -l, -1, -v, -w, /tmp/graph10754254781259729121.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 06:23:53] [INFO ] Decomposing Gal with order
[2021-05-18 06:23:57] [INFO ] Rewriting arrays to variables to allow decomposition.
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13350867985023248510] killed by timeout after 25 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13350867985023248510] killed by timeout after 25 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
[2021-05-18 06:24:30] [INFO ] Removed a total of 16051 redundant transitions.
[2021-05-18 06:24:30] [INFO ] Flatten gal took : 9559 ms
[2021-05-18 06:24:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 203 labels/synchronizations in 494 ms.
[2021-05-18 06:24:32] [INFO ] Time to serialize gal into /tmp/LTLFireability11353210453793481363.gal : 156 ms
[2021-05-18 06:24:32] [INFO ] Time to serialize properties into /tmp/LTLFireability14267011760847782984.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability11353210453793481363.gal, -t, CGAL, -LTL, /tmp/LTLFireability14267011760847782984.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability11353210453793481363.gal -t CGAL -LTL /tmp/LTLFireability14267011760847782984.ltl -c -stutter-deadlock
Read 3 LTL properties
Checking formula 0 : !(((((!("((i2.u3587.Node55HasAskedItsLeafSetToLxToReplaceNode7>=1)&&(u4223.LeafSetOfLxIsSentToNode55>=1))"))&&(X((!("((i2.u3587.Node55HasAskedItsLeafSetToLxToReplaceNode7>=1)&&(u4223.LeafSetOfLxIsSentToNode55>=1))"))U((!("((i4.i0.u32.Node24DontAnswerToAnyNode>=1)&&(i10.i1.u3966.Node61IsActive>=1))"))||(G(!("((i2.u3587.Node55HasAskedItsLeafSetToLxToReplaceNode7>=1)&&(u4223.LeafSetOfLxIsSentToNode55>=1))")))))))U((((!("((i2.u3587.Node55HasAskedItsLeafSetToLxToReplaceNode7>=1)&&(u4223.LeafSetOfLxIsSentToNode55>=1))"))&&(G(F(("(u4224.Node44HasTheLeafSetOfRxToReplaceNode61<1)")U(("((!((i2.u3587.Node55HasAskedItsLeafSetToLxToReplaceNode7>=1)&&(u4223.LeafSetOfLxIsSentToNode55>=1)))&&(u4224.Node44HasTheLeafSetOfRxToReplaceNode61<1))")||(G("(u4224.Node44HasTheLeafSetOfRxToReplaceNode61<1)")))))))&&(X((!("((i2.u3587.Node55HasAskedItsLeafSetToLxToReplaceNode7>=1)&&(u4223.LeafSetOfLxIsSentToNode55>=1))"))U((!("((i4.i0.u32.Node24DontAnswerToAnyNode>=1)&&(i10.i1.u3966.Node61IsActive>=1))"))||(G(!("((i2.u3587.Node55HasAskedItsLeafSetToLxToReplaceNode7>=1)&&(u4223.LeafSetOfLxIsSentToNode55>=1))")))))))||(G((!("((i2.u3587.Node55HasAskedItsLeafSetToLxToReplaceNode7>=1)&&(u4223.LeafSetOfLxIsSentToNode55>=1))"))&&(X((!("((i2.u3587.Node55HasAskedItsLeafSetToLxToReplaceNode7>=1)&&(u4223.LeafSetOfLxIsSentToNode55>=1))"))U((!("((i4.i0.u32.Node24DontAnswerToAnyNode>=1)&&(i10.i1.u3966.Node61IsActive>=1))"))||(G(!("((i2.u3587.Node55HasAskedItsLeafSetToLxToReplaceNode7>=1)&&(u4223.LeafSetOfLxIsSentToNode55>=1))"))))))))))U(G(!("((i54.i10.u71.NoNodeManageTheBreakDownOfNode53>=1)&&(i54.i10.u3761.Node57WantsToManageTheBreakDownOfNode53>=1))")))))
Formula 0 simplified : !(((!"((i2.u3587.Node55HasAskedItsLeafSetToLxToReplaceNode7>=1)&&(u4223.LeafSetOfLxIsSentToNode55>=1))" & X(!"((i2.u3587.Node55HasAskedItsLeafSetToLxToReplaceNode7>=1)&&(u4223.LeafSetOfLxIsSentToNode55>=1))" U (!"((i4.i0.u32.Node24DontAnswerToAnyNode>=1)&&(i10.i1.u3966.Node61IsActive>=1))" | G!"((i2.u3587.Node55HasAskedItsLeafSetToLxToReplaceNode7>=1)&&(u4223.LeafSetOfLxIsSentToNode55>=1))"))) U ((!"((i2.u3587.Node55HasAskedItsLeafSetToLxToReplaceNode7>=1)&&(u4223.LeafSetOfLxIsSentToNode55>=1))" & X(!"((i2.u3587.Node55HasAskedItsLeafSetToLxToReplaceNode7>=1)&&(u4223.LeafSetOfLxIsSentToNode55>=1))" U (!"((i4.i0.u32.Node24DontAnswerToAnyNode>=1)&&(i10.i1.u3966.Node61IsActive>=1))" | G!"((i2.u3587.Node55HasAskedItsLeafSetToLxToReplaceNode7>=1)&&(u4223.LeafSetOfLxIsSentToNode55>=1))")) & GF("(u4224.Node44HasTheLeafSetOfRxToReplaceNode61<1)" U ("((!((i2.u3587.Node55HasAskedItsLeafSetToLxToReplaceNode7>=1)&&(u4223.LeafSetOfLxIsSentToNode55>=1)))&&(u4224.Node44HasTheLeafSetOfRxToReplaceNode61<1))" | G"(u4224.Node44HasTheLeafSetOfRxToReplaceNode61<1)"))) | G(!"((i2.u3587.Node55HasAskedItsLeafSetToLxToReplaceNode7>=1)&&(u4223.LeafSetOfLxIsSentToNode55>=1))" & X(!"((i2.u3587.Node55HasAskedItsLeafSetToLxToReplaceNode7>=1)&&(u4223.LeafSetOfLxIsSentToNode55>=1))" U (!"((i4.i0.u32.Node24DontAnswerToAnyNode>=1)&&(i10.i1.u3966.Node61IsActive>=1))" | G!"((i2.u3587.Node55HasAskedItsLeafSetToLxToReplaceNode7>=1)&&(u4223.LeafSetOfLxIsSentToNode55>=1))"))))) U G!"((i54.i10.u71.NoNodeManageTheBreakDownOfNode53>=1)&&(i54.i10.u3761.Node57WantsToManageTheBreakDownOfNode53>=1))")
ITS-tools command line returned an error code 137
[2021-05-18 06:38:19] [INFO ] Flatten gal took : 5141 ms
[2021-05-18 06:38:20] [INFO ] Time to serialize gal into /tmp/LTLFireability13837871967352803293.gal : 88 ms
[2021-05-18 06:38:20] [INFO ] Time to serialize properties into /tmp/LTLFireability17452432467462955983.ltl : 6 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability13837871967352803293.gal, -t, CGAL, -LTL, /tmp/LTLFireability17452432467462955983.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability13837871967352803293.gal -t CGAL -LTL /tmp/LTLFireability17452432467462955983.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 3 LTL properties
Checking formula 0 : !(((((!("((Node55HasAskedItsLeafSetToLxToReplaceNode7>=1)&&(LeafSetOfLxIsSentToNode55>=1))"))&&(X((!("((Node55HasAskedItsLeafSetToLxToReplaceNode7>=1)&&(LeafSetOfLxIsSentToNode55>=1))"))U((!("((Node24DontAnswerToAnyNode>=1)&&(Node61IsActive>=1))"))||(G(!("((Node55HasAskedItsLeafSetToLxToReplaceNode7>=1)&&(LeafSetOfLxIsSentToNode55>=1))")))))))U((((!("((Node55HasAskedItsLeafSetToLxToReplaceNode7>=1)&&(LeafSetOfLxIsSentToNode55>=1))"))&&(G(F(("(Node44HasTheLeafSetOfRxToReplaceNode61<1)")U(("((!((Node55HasAskedItsLeafSetToLxToReplaceNode7>=1)&&(LeafSetOfLxIsSentToNode55>=1)))&&(Node44HasTheLeafSetOfRxToReplaceNode61<1))")||(G("(Node44HasTheLeafSetOfRxToReplaceNode61<1)")))))))&&(X((!("((Node55HasAskedItsLeafSetToLxToReplaceNode7>=1)&&(LeafSetOfLxIsSentToNode55>=1))"))U((!("((Node24DontAnswerToAnyNode>=1)&&(Node61IsActive>=1))"))||(G(!("((Node55HasAskedItsLeafSetToLxToReplaceNode7>=1)&&(LeafSetOfLxIsSentToNode55>=1))")))))))||(G((!("((Node55HasAskedItsLeafSetToLxToReplaceNode7>=1)&&(LeafSetOfLxIsSentToNode55>=1))"))&&(X((!("((Node55HasAskedItsLeafSetToLxToReplaceNode7>=1)&&(LeafSetOfLxIsSentToNode55>=1))"))U((!("((Node24DontAnswerToAnyNode>=1)&&(Node61IsActive>=1))"))||(G(!("((Node55HasAskedItsLeafSetToLxToReplaceNode7>=1)&&(LeafSetOfLxIsSentToNode55>=1))"))))))))))U(G(!("((NoNodeManageTheBreakDownOfNode53>=1)&&(Node57WantsToManageTheBreakDownOfNode53>=1))")))))
Formula 0 simplified : !(((!"((Node55HasAskedItsLeafSetToLxToReplaceNode7>=1)&&(LeafSetOfLxIsSentToNode55>=1))" & X(!"((Node55HasAskedItsLeafSetToLxToReplaceNode7>=1)&&(LeafSetOfLxIsSentToNode55>=1))" U (!"((Node24DontAnswerToAnyNode>=1)&&(Node61IsActive>=1))" | G!"((Node55HasAskedItsLeafSetToLxToReplaceNode7>=1)&&(LeafSetOfLxIsSentToNode55>=1))"))) U ((!"((Node55HasAskedItsLeafSetToLxToReplaceNode7>=1)&&(LeafSetOfLxIsSentToNode55>=1))" & X(!"((Node55HasAskedItsLeafSetToLxToReplaceNode7>=1)&&(LeafSetOfLxIsSentToNode55>=1))" U (!"((Node24DontAnswerToAnyNode>=1)&&(Node61IsActive>=1))" | G!"((Node55HasAskedItsLeafSetToLxToReplaceNode7>=1)&&(LeafSetOfLxIsSentToNode55>=1))")) & GF("(Node44HasTheLeafSetOfRxToReplaceNode61<1)" U ("((!((Node55HasAskedItsLeafSetToLxToReplaceNode7>=1)&&(LeafSetOfLxIsSentToNode55>=1)))&&(Node44HasTheLeafSetOfRxToReplaceNode61<1))" | G"(Node44HasTheLeafSetOfRxToReplaceNode61<1)"))) | G(!"((Node55HasAskedItsLeafSetToLxToReplaceNode7>=1)&&(LeafSetOfLxIsSentToNode55>=1))" & X(!"((Node55HasAskedItsLeafSetToLxToReplaceNode7>=1)&&(LeafSetOfLxIsSentToNode55>=1))" U (!"((Node24DontAnswerToAnyNode>=1)&&(Node61IsActive>=1))" | G!"((Node55HasAskedItsLeafSetToLxToReplaceNode7>=1)&&(LeafSetOfLxIsSentToNode55>=1))"))))) U G!"((NoNodeManageTheBreakDownOfNode53>=1)&&(Node57WantsToManageTheBreakDownOfNode53>=1))")
ITS-tools command line returned an error code 137
[2021-05-18 07:00:53] [INFO ] Flatten gal took : 1406 ms
[2021-05-18 07:00:56] [INFO ] Input system was already deterministic with 21129 transitions.
[2021-05-18 07:00:56] [INFO ] Transformed 17233 places.
[2021-05-18 07:00:56] [INFO ] Transformed 21129 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-18 07:01:20] [INFO ] Time to serialize gal into /tmp/LTLFireability10247239373656234601.gal : 56 ms
[2021-05-18 07:01:20] [INFO ] Time to serialize properties into /tmp/LTLFireability13276264988527223804.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability10247239373656234601.gal, -t, CGAL, -LTL, /tmp/LTLFireability13276264988527223804.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability10247239373656234601.gal -t CGAL -LTL /tmp/LTLFireability13276264988527223804.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((((!("((Node55HasAskedItsLeafSetToLxToReplaceNode7>=1)&&(LeafSetOfLxIsSentToNode55>=1))"))&&(X((!("((Node55HasAskedItsLeafSetToLxToReplaceNode7>=1)&&(LeafSetOfLxIsSentToNode55>=1))"))U((!("((Node24DontAnswerToAnyNode>=1)&&(Node61IsActive>=1))"))||(G(!("((Node55HasAskedItsLeafSetToLxToReplaceNode7>=1)&&(LeafSetOfLxIsSentToNode55>=1))")))))))U((((!("((Node55HasAskedItsLeafSetToLxToReplaceNode7>=1)&&(LeafSetOfLxIsSentToNode55>=1))"))&&(G(F(("(Node44HasTheLeafSetOfRxToReplaceNode61<1)")U(("((!((Node55HasAskedItsLeafSetToLxToReplaceNode7>=1)&&(LeafSetOfLxIsSentToNode55>=1)))&&(Node44HasTheLeafSetOfRxToReplaceNode61<1))")||(G("(Node44HasTheLeafSetOfRxToReplaceNode61<1)")))))))&&(X((!("((Node55HasAskedItsLeafSetToLxToReplaceNode7>=1)&&(LeafSetOfLxIsSentToNode55>=1))"))U((!("((Node24DontAnswerToAnyNode>=1)&&(Node61IsActive>=1))"))||(G(!("((Node55HasAskedItsLeafSetToLxToReplaceNode7>=1)&&(LeafSetOfLxIsSentToNode55>=1))")))))))||(G((!("((Node55HasAskedItsLeafSetToLxToReplaceNode7>=1)&&(LeafSetOfLxIsSentToNode55>=1))"))&&(X((!("((Node55HasAskedItsLeafSetToLxToReplaceNode7>=1)&&(LeafSetOfLxIsSentToNode55>=1))"))U((!("((Node24DontAnswerToAnyNode>=1)&&(Node61IsActive>=1))"))||(G(!("((Node55HasAskedItsLeafSetToLxToReplaceNode7>=1)&&(LeafSetOfLxIsSentToNode55>=1))"))))))))))U(G(!("((NoNodeManageTheBreakDownOfNode53>=1)&&(Node57WantsToManageTheBreakDownOfNode53>=1))")))))
Formula 0 simplified : !(((!"((Node55HasAskedItsLeafSetToLxToReplaceNode7>=1)&&(LeafSetOfLxIsSentToNode55>=1))" & X(!"((Node55HasAskedItsLeafSetToLxToReplaceNode7>=1)&&(LeafSetOfLxIsSentToNode55>=1))" U (!"((Node24DontAnswerToAnyNode>=1)&&(Node61IsActive>=1))" | G!"((Node55HasAskedItsLeafSetToLxToReplaceNode7>=1)&&(LeafSetOfLxIsSentToNode55>=1))"))) U ((!"((Node55HasAskedItsLeafSetToLxToReplaceNode7>=1)&&(LeafSetOfLxIsSentToNode55>=1))" & X(!"((Node55HasAskedItsLeafSetToLxToReplaceNode7>=1)&&(LeafSetOfLxIsSentToNode55>=1))" U (!"((Node24DontAnswerToAnyNode>=1)&&(Node61IsActive>=1))" | G!"((Node55HasAskedItsLeafSetToLxToReplaceNode7>=1)&&(LeafSetOfLxIsSentToNode55>=1))")) & GF("(Node44HasTheLeafSetOfRxToReplaceNode61<1)" U ("((!((Node55HasAskedItsLeafSetToLxToReplaceNode7>=1)&&(LeafSetOfLxIsSentToNode55>=1)))&&(Node44HasTheLeafSetOfRxToReplaceNode61<1))" | G"(Node44HasTheLeafSetOfRxToReplaceNode61<1)"))) | G(!"((Node55HasAskedItsLeafSetToLxToReplaceNode7>=1)&&(LeafSetOfLxIsSentToNode55>=1))" & X(!"((Node55HasAskedItsLeafSetToLxToReplaceNode7>=1)&&(LeafSetOfLxIsSentToNode55>=1))" U (!"((Node24DontAnswerToAnyNode>=1)&&(Node61IsActive>=1))" | G!"((Node55HasAskedItsLeafSetToLxToReplaceNode7>=1)&&(LeafSetOfLxIsSentToNode55>=1))"))))) U G!"((NoNodeManageTheBreakDownOfNode53>=1)&&(Node57WantsToManageTheBreakDownOfNode53>=1))")

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="LeafsetExtension-PT-S64C4"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is LeafsetExtension-PT-S64C4, 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 r292-tall-162124156700565"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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