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-162124155900044.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 CANConstruction-PT-050, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r292-tall-162124155900044
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 22K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 114K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 20K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 103K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 12 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 12 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 12 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 12 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 4.4K May 11 18:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 11 18:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 11 15:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 11 15:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 12 04:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 12 04:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 4 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 12M 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 CANConstruction-PT-050-00
FORMULA_NAME CANConstruction-PT-050-01
FORMULA_NAME CANConstruction-PT-050-02
FORMULA_NAME CANConstruction-PT-050-03
FORMULA_NAME CANConstruction-PT-050-04
FORMULA_NAME CANConstruction-PT-050-05
FORMULA_NAME CANConstruction-PT-050-06
FORMULA_NAME CANConstruction-PT-050-07
FORMULA_NAME CANConstruction-PT-050-08
FORMULA_NAME CANConstruction-PT-050-09
FORMULA_NAME CANConstruction-PT-050-10
FORMULA_NAME CANConstruction-PT-050-11
FORMULA_NAME CANConstruction-PT-050-12
FORMULA_NAME CANConstruction-PT-050-13
FORMULA_NAME CANConstruction-PT-050-14
FORMULA_NAME CANConstruction-PT-050-15

=== Now, execution of the tool begins

BK_START 1621250481128

Running Version 0
[2021-05-17 11:21:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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-17 11:21:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 11:21:23] [INFO ] Load time of PNML (sax parser for PT used): 396 ms
[2021-05-17 11:21:23] [INFO ] Transformed 5602 places.
[2021-05-17 11:21:23] [INFO ] Transformed 10400 transitions.
[2021-05-17 11:21:23] [INFO ] Parsed PT model containing 5602 places and 10400 transitions in 469 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 11:21:23] [INFO ] Initial state test concluded for 3 properties.
FORMULA CANConstruction-PT-050-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-050-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-050-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 5602 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5602/5602 places, 10400/10400 transitions.
Discarding 2386 places :
Symmetric choice reduction at 0 with 2386 rule applications. Total rules 2386 place count 3216 transition count 5628
Iterating global reduction 0 with 2386 rules applied. Total rules applied 4772 place count 3216 transition count 5628
Applied a total of 4772 rules in 806 ms. Remains 3216 /5602 variables (removed 2386) and now considering 5628/10400 (removed 4772) transitions.
// Phase 1: matrix 5628 rows 3216 cols
[2021-05-17 11:21:24] [INFO ] Computed 101 place invariants in 92 ms
[2021-05-17 11:21:27] [INFO ] Implicit Places using invariants in 2915 ms returned []
// Phase 1: matrix 5628 rows 3216 cols
[2021-05-17 11:21:27] [INFO ] Computed 101 place invariants in 33 ms
[2021-05-17 11:21:28] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2021-05-17 11:21:39] [INFO ] Implicit Places using invariants and state equation in 12478 ms returned [12, 26, 40, 54, 68, 82, 96, 110, 124, 138, 152, 166, 180, 194, 208, 222, 236, 250, 264, 278, 292, 306, 320, 334, 348, 362, 376, 390, 404, 418, 432, 446, 460, 474, 488, 502, 516, 530, 544, 558, 572, 586, 600, 614, 628, 642, 656, 670, 684, 698]
Discarding 50 places :
Implicit Place search using SMT with State Equation took 15425 ms to find 50 implicit places.
// Phase 1: matrix 5628 rows 3166 cols
[2021-05-17 11:21:39] [INFO ] Computed 51 place invariants in 44 ms
[2021-05-17 11:21:42] [INFO ] Dead Transitions using invariants and state equation in 2911 ms returned []
Starting structural reductions, iteration 1 : 3166/5602 places, 5628/10400 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 3116 transition count 5578
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 3116 transition count 5578
Applied a total of 100 rules in 1228 ms. Remains 3116 /3166 variables (removed 50) and now considering 5578/5628 (removed 50) transitions.
// Phase 1: matrix 5578 rows 3116 cols
[2021-05-17 11:21:43] [INFO ] Computed 51 place invariants in 40 ms
[2021-05-17 11:21:45] [INFO ] Implicit Places using invariants in 1741 ms returned []
// Phase 1: matrix 5578 rows 3116 cols
[2021-05-17 11:21:45] [INFO ] Computed 51 place invariants in 30 ms
[2021-05-17 11:21:46] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2021-05-17 11:22:07] [INFO ] Implicit Places using invariants and state equation in 22069 ms returned []
Implicit Place search using SMT with State Equation took 23812 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 3116/5602 places, 5578/10400 transitions.
[2021-05-17 11:22:07] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-17 11:22:07] [INFO ] Flatten gal took : 321 ms
FORMULA CANConstruction-PT-050-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-050-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 11:22:08] [INFO ] Flatten gal took : 209 ms
[2021-05-17 11:22:08] [INFO ] Input system was already deterministic with 5578 transitions.
Incomplete random walk after 100000 steps, including 109 resets, run finished after 1036 ms. (steps per millisecond=96 ) properties (out of 18) seen :15
Running SMT prover for 3 properties.
// Phase 1: matrix 5578 rows 3116 cols
[2021-05-17 11:22:09] [INFO ] Computed 51 place invariants in 33 ms
[2021-05-17 11:22:10] [INFO ] [Real]Absence check using 51 positive place invariants in 57 ms returned sat
[2021-05-17 11:22:10] [INFO ] SMT Verify possible in real domain returnedunsat :3 sat :0 real:0
Successfully simplified 3 atomic propositions for a total of 11 simplifications.
[2021-05-17 11:22:10] [INFO ] Initial state test concluded for 2 properties.
FORMULA CANConstruction-PT-050-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-050-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 3116 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3116/3116 places, 5578/5578 transitions.
Drop transitions removed 287 transitions
Trivial Post-agglo rules discarded 287 transitions
Performed 287 trivial Post agglomeration. Transition count delta: 287
Iterating post reduction 0 with 287 rules applied. Total rules applied 287 place count 3116 transition count 5291
Reduce places removed 287 places and 0 transitions.
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Iterating post reduction 1 with 337 rules applied. Total rules applied 624 place count 2829 transition count 5241
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 2 with 50 rules applied. Total rules applied 674 place count 2779 transition count 5241
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 50 Pre rules applied. Total rules applied 674 place count 2779 transition count 5191
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 774 place count 2729 transition count 5191
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 787 place count 2716 transition count 5165
Iterating global reduction 3 with 13 rules applied. Total rules applied 800 place count 2716 transition count 5165
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 3 with 12 rules applied. Total rules applied 812 place count 2716 transition count 5153
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 824 place count 2704 transition count 5153
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 5 with 102 rules applied. Total rules applied 926 place count 2653 transition count 5102
Applied a total of 926 rules in 1151 ms. Remains 2653 /3116 variables (removed 463) and now considering 5102/5578 (removed 476) transitions.
// Phase 1: matrix 5102 rows 2653 cols
[2021-05-17 11:22:11] [INFO ] Computed 51 place invariants in 37 ms
[2021-05-17 11:22:13] [INFO ] Implicit Places using invariants in 1652 ms returned []
// Phase 1: matrix 5102 rows 2653 cols
[2021-05-17 11:22:13] [INFO ] Computed 51 place invariants in 51 ms
[2021-05-17 11:22:13] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2021-05-17 11:22:32] [INFO ] Implicit Places using invariants and state equation in 19330 ms returned []
Implicit Place search using SMT with State Equation took 20984 ms to find 0 implicit places.
[2021-05-17 11:22:32] [INFO ] Redundant transitions in 392 ms returned []
// Phase 1: matrix 5102 rows 2653 cols
[2021-05-17 11:22:32] [INFO ] Computed 51 place invariants in 37 ms
[2021-05-17 11:22:35] [INFO ] Dead Transitions using invariants and state equation in 2395 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2653/3116 places, 5102/5578 transitions.
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-050-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(GT s751 s389), p0:(LEQ s1 s1233)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 626 reset in 1181 ms.
Product exploration explored 100000 steps with 586 reset in 1100 ms.
Knowledge obtained : [(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 558 reset in 1040 ms.
Product exploration explored 100000 steps with 580 reset in 1078 ms.
[2021-05-17 11:22:40] [INFO ] Flatten gal took : 154 ms
[2021-05-17 11:22:40] [INFO ] Flatten gal took : 148 ms
[2021-05-17 11:22:40] [INFO ] Time to serialize gal into /tmp/LTL14423270121040156591.gal : 53 ms
[2021-05-17 11:22:40] [INFO ] Time to serialize properties into /tmp/LTL151055606076924194.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/LTL14423270121040156591.gal, -t, CGAL, -LTL, /tmp/LTL151055606076924194.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/LTL14423270121040156591.gal -t CGAL -LTL /tmp/LTL151055606076924194.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F(("(EmptyCAN<=Node21GiveAnswer1)")||(G("(Node11requestsent10>Node3requestsent41)"))))))
Formula 0 simplified : !GF("(EmptyCAN<=Node21GiveAnswer1)" | G"(Node11requestsent10>Node3requestsent41)")
Detected timeout of ITS tools.
[2021-05-17 11:22:55] [INFO ] Flatten gal took : 142 ms
[2021-05-17 11:22:55] [INFO ] Applying decomposition
[2021-05-17 11:22:55] [INFO ] Flatten gal took : 150 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/graph13868825675700924575.txt, -o, /tmp/graph13868825675700924575.bin, -w, /tmp/graph13868825675700924575.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/graph13868825675700924575.bin, -l, -1, -v, -w, /tmp/graph13868825675700924575.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 11:22:56] [INFO ] Decomposing Gal with order
[2021-05-17 11:22:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 11:22:56] [INFO ] Removed a total of 4995 redundant transitions.
[2021-05-17 11:22:57] [INFO ] Flatten gal took : 895 ms
[2021-05-17 11:22:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 4794 labels/synchronizations in 412 ms.
[2021-05-17 11:22:57] [INFO ] Time to serialize gal into /tmp/LTL4268597250637440877.gal : 22 ms
[2021-05-17 11:22:57] [INFO ] Time to serialize properties into /tmp/LTL14091384994029020174.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/LTL4268597250637440877.gal, -t, CGAL, -LTL, /tmp/LTL14091384994029020174.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/LTL4268597250637440877.gal -t CGAL -LTL /tmp/LTL14091384994029020174.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F(("(gu0.EmptyCAN<=gu0.Node21GiveAnswer1)")||(G("(gu51.Node11requestsent10>gu51.Node3requestsent41)"))))))
Formula 0 simplified : !GF("(gu0.EmptyCAN<=gu0.Node21GiveAnswer1)" | G"(gu51.Node11requestsent10>gu51.Node3requestsent41)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1556709202591728707
[2021-05-17 11:23:12] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1556709202591728707
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/ltsmin1556709202591728707]
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/ltsmin1556709202591728707] 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/ltsmin1556709202591728707] 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 CANConstruction-PT-050-01 finished in 63805 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((p0 U (p1||G(p0))) U (p2&&(p0 U (p1||G(p0)))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 3116 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3116/3116 places, 5578/5578 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 3103 transition count 5552
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 3103 transition count 5552
Applied a total of 26 rules in 841 ms. Remains 3103 /3116 variables (removed 13) and now considering 5552/5578 (removed 26) transitions.
// Phase 1: matrix 5552 rows 3103 cols
[2021-05-17 11:23:14] [INFO ] Computed 51 place invariants in 29 ms
[2021-05-17 11:23:16] [INFO ] Implicit Places using invariants in 1751 ms returned []
// Phase 1: matrix 5552 rows 3103 cols
[2021-05-17 11:23:16] [INFO ] Computed 51 place invariants in 30 ms
[2021-05-17 11:23:17] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2021-05-17 11:23:41] [INFO ] Implicit Places using invariants and state equation in 24885 ms returned []
Implicit Place search using SMT with State Equation took 26638 ms to find 0 implicit places.
// Phase 1: matrix 5552 rows 3103 cols
[2021-05-17 11:23:41] [INFO ] Computed 51 place invariants in 34 ms
[2021-05-17 11:23:44] [INFO ] Dead Transitions using invariants and state equation in 2882 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3103/3116 places, 5552/5578 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p0)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), true, (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : CANConstruction-PT-050-02 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 (NOT p1) p0), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(AND (GT s150 s368) (GT s2376 s2195)), p0:(GT s2376 s2195), p2:(GT s2881 s1961)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 1 ms.
FORMULA CANConstruction-PT-050-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-02 finished in 30494 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 3116 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3116/3116 places, 5578/5578 transitions.
Drop transitions removed 335 transitions
Trivial Post-agglo rules discarded 335 transitions
Performed 335 trivial Post agglomeration. Transition count delta: 335
Iterating post reduction 0 with 335 rules applied. Total rules applied 335 place count 3116 transition count 5243
Reduce places removed 335 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 336 rules applied. Total rules applied 671 place count 2781 transition count 5242
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 672 place count 2780 transition count 5242
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 50 Pre rules applied. Total rules applied 672 place count 2780 transition count 5192
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 772 place count 2730 transition count 5192
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 785 place count 2717 transition count 5166
Iterating global reduction 3 with 13 rules applied. Total rules applied 798 place count 2717 transition count 5166
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 3 with 12 rules applied. Total rules applied 810 place count 2717 transition count 5154
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 822 place count 2705 transition count 5154
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 5 with 102 rules applied. Total rules applied 924 place count 2654 transition count 5103
Applied a total of 924 rules in 749 ms. Remains 2654 /3116 variables (removed 462) and now considering 5103/5578 (removed 475) transitions.
// Phase 1: matrix 5103 rows 2654 cols
[2021-05-17 11:23:45] [INFO ] Computed 51 place invariants in 38 ms
[2021-05-17 11:23:46] [INFO ] Implicit Places using invariants in 1617 ms returned []
// Phase 1: matrix 5103 rows 2654 cols
[2021-05-17 11:23:46] [INFO ] Computed 51 place invariants in 56 ms
[2021-05-17 11:23:47] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2021-05-17 11:24:08] [INFO ] Implicit Places using invariants and state equation in 21943 ms returned []
Implicit Place search using SMT with State Equation took 23560 ms to find 0 implicit places.
[2021-05-17 11:24:09] [INFO ] Redundant transitions in 219 ms returned []
// Phase 1: matrix 5103 rows 2654 cols
[2021-05-17 11:24:09] [INFO ] Computed 51 place invariants in 38 ms
[2021-05-17 11:24:11] [INFO ] Dead Transitions using invariants and state equation in 2383 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2654/3116 places, 5103/5578 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-050-03 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GT s33 s1237)], 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 350 steps with 0 reset in 5 ms.
FORMULA CANConstruction-PT-050-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-03 finished in 26969 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 3116 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3116/3116 places, 5578/5578 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 3103 transition count 5552
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 3103 transition count 5552
Applied a total of 26 rules in 580 ms. Remains 3103 /3116 variables (removed 13) and now considering 5552/5578 (removed 26) transitions.
// Phase 1: matrix 5552 rows 3103 cols
[2021-05-17 11:24:12] [INFO ] Computed 51 place invariants in 28 ms
[2021-05-17 11:24:13] [INFO ] Implicit Places using invariants in 1757 ms returned []
// Phase 1: matrix 5552 rows 3103 cols
[2021-05-17 11:24:13] [INFO ] Computed 51 place invariants in 28 ms
[2021-05-17 11:24:14] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2021-05-17 11:24:39] [INFO ] Implicit Places using invariants and state equation in 25572 ms returned []
Implicit Place search using SMT with State Equation took 27330 ms to find 0 implicit places.
// Phase 1: matrix 5552 rows 3103 cols
[2021-05-17 11:24:39] [INFO ] Computed 51 place invariants in 28 ms
[2021-05-17 11:24:42] [INFO ] Dead Transitions using invariants and state equation in 2946 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3103/3116 places, 5552/5578 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-050-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s1577)], 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 868 steps with 0 reset in 7 ms.
FORMULA CANConstruction-PT-050-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-04 finished in 30929 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 3116 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3116/3116 places, 5578/5578 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 3103 transition count 5552
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 3103 transition count 5552
Applied a total of 26 rules in 459 ms. Remains 3103 /3116 variables (removed 13) and now considering 5552/5578 (removed 26) transitions.
// Phase 1: matrix 5552 rows 3103 cols
[2021-05-17 11:24:42] [INFO ] Computed 51 place invariants in 40 ms
[2021-05-17 11:24:44] [INFO ] Implicit Places using invariants in 1749 ms returned []
// Phase 1: matrix 5552 rows 3103 cols
[2021-05-17 11:24:44] [INFO ] Computed 51 place invariants in 36 ms
[2021-05-17 11:24:45] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2021-05-17 11:25:06] [INFO ] Implicit Places using invariants and state equation in 22387 ms returned []
Implicit Place search using SMT with State Equation took 24137 ms to find 0 implicit places.
// Phase 1: matrix 5552 rows 3103 cols
[2021-05-17 11:25:07] [INFO ] Computed 51 place invariants in 27 ms
[2021-05-17 11:25:09] [INFO ] Dead Transitions using invariants and state equation in 2805 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3103/3116 places, 5552/5578 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-050-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s775 s1938)], 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]]
Product exploration explored 100000 steps with 50000 reset in 2879 ms.
Product exploration explored 100000 steps with 50000 reset in 2894 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 2854 ms.
Product exploration explored 100000 steps with 50000 reset in 2874 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 3103 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 3103/3103 places, 5552/5552 transitions.
Performed 200 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 3103 transition count 5552
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 50 Pre rules applied. Total rules applied 200 place count 3103 transition count 5552
Deduced a syphon composed of 250 places in 1 ms
Iterating global reduction 1 with 50 rules applied. Total rules applied 250 place count 3103 transition count 5552
Discarding 100 places :
Symmetric choice reduction at 1 with 100 rule applications. Total rules 350 place count 3003 transition count 5452
Deduced a syphon composed of 150 places in 1 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 450 place count 3003 transition count 5452
Performed 200 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 350 places in 1 ms
Iterating global reduction 1 with 200 rules applied. Total rules applied 650 place count 3003 transition count 5452
Discarding 250 places :
Symmetric choice reduction at 1 with 250 rule applications. Total rules 900 place count 2753 transition count 5202
Deduced a syphon composed of 100 places in 1 ms
Iterating global reduction 1 with 250 rules applied. Total rules applied 1150 place count 2753 transition count 5202
Deduced a syphon composed of 100 places in 1 ms
Applied a total of 1150 rules in 1674 ms. Remains 2753 /3103 variables (removed 350) and now considering 5202/5552 (removed 350) transitions.
[2021-05-17 11:25:23] [INFO ] Redundant transitions in 364 ms returned []
// Phase 1: matrix 5202 rows 2753 cols
[2021-05-17 11:25:23] [INFO ] Computed 51 place invariants in 42 ms
[2021-05-17 11:25:26] [INFO ] Dead Transitions using invariants and state equation in 2552 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2753/3103 places, 5202/5552 transitions.
Product exploration timeout after 52520 steps with 26260 reset in 10002 ms.
Product exploration timeout after 53210 steps with 26605 reset in 10001 ms.
[2021-05-17 11:25:46] [INFO ] Flatten gal took : 149 ms
[2021-05-17 11:25:46] [INFO ] Flatten gal took : 151 ms
[2021-05-17 11:25:46] [INFO ] Time to serialize gal into /tmp/LTL13364187769186886457.gal : 24 ms
[2021-05-17 11:25:46] [INFO ] Time to serialize properties into /tmp/LTL6044533758283046848.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/LTL13364187769186886457.gal, -t, CGAL, -LTL, /tmp/LTL6044533758283046848.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/LTL13364187769186886457.gal -t CGAL -LTL /tmp/LTL6044533758283046848.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(Node2GiveAnswer25<=Node26requestsent11)"))))
Formula 0 simplified : !XF"(Node2GiveAnswer25<=Node26requestsent11)"
Detected timeout of ITS tools.
[2021-05-17 11:26:01] [INFO ] Flatten gal took : 144 ms
[2021-05-17 11:26:01] [INFO ] Applying decomposition
[2021-05-17 11:26:01] [INFO ] Flatten gal took : 149 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/graph2978358005639204040.txt, -o, /tmp/graph2978358005639204040.bin, -w, /tmp/graph2978358005639204040.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/graph2978358005639204040.bin, -l, -1, -v, -w, /tmp/graph2978358005639204040.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 11:26:02] [INFO ] Decomposing Gal with order
[2021-05-17 11:26:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 11:26:02] [INFO ] Removed a total of 4948 redundant transitions.
[2021-05-17 11:26:03] [INFO ] Flatten gal took : 654 ms
[2021-05-17 11:26:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 4800 labels/synchronizations in 360 ms.
[2021-05-17 11:26:03] [INFO ] Time to serialize gal into /tmp/LTL7720276640821960801.gal : 17 ms
[2021-05-17 11:26:03] [INFO ] Time to serialize properties into /tmp/LTL2637595713382324987.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/LTL7720276640821960801.gal, -t, CGAL, -LTL, /tmp/LTL2637595713382324987.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/LTL7720276640821960801.gal -t CGAL -LTL /tmp/LTL2637595713382324987.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(gu223.Node2GiveAnswer25<=gu223.Node26requestsent11)"))))
Formula 0 simplified : !XF"(gu223.Node2GiveAnswer25<=gu223.Node26requestsent11)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8559095967477900155
[2021-05-17 11:26:18] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8559095967477900155
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/ltsmin8559095967477900155]
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/ltsmin8559095967477900155] 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/ltsmin8559095967477900155] 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 CANConstruction-PT-050-06 finished in 97552 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 3116 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3116/3116 places, 5578/5578 transitions.
Drop transitions removed 337 transitions
Trivial Post-agglo rules discarded 337 transitions
Performed 337 trivial Post agglomeration. Transition count delta: 337
Iterating post reduction 0 with 337 rules applied. Total rules applied 337 place count 3116 transition count 5241
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 1 with 337 rules applied. Total rules applied 674 place count 2779 transition count 5241
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 674 place count 2779 transition count 5191
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 774 place count 2729 transition count 5191
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 788 place count 2715 transition count 5163
Iterating global reduction 2 with 14 rules applied. Total rules applied 802 place count 2715 transition count 5163
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 2 with 13 rules applied. Total rules applied 815 place count 2715 transition count 5150
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 828 place count 2702 transition count 5150
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 928 place count 2652 transition count 5100
Applied a total of 928 rules in 799 ms. Remains 2652 /3116 variables (removed 464) and now considering 5100/5578 (removed 478) transitions.
// Phase 1: matrix 5100 rows 2652 cols
[2021-05-17 11:26:20] [INFO ] Computed 51 place invariants in 37 ms
[2021-05-17 11:26:22] [INFO ] Implicit Places using invariants in 1626 ms returned []
// Phase 1: matrix 5100 rows 2652 cols
[2021-05-17 11:26:22] [INFO ] Computed 51 place invariants in 37 ms
[2021-05-17 11:26:23] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2021-05-17 11:26:45] [INFO ] Implicit Places using invariants and state equation in 23080 ms returned []
Implicit Place search using SMT with State Equation took 24710 ms to find 0 implicit places.
[2021-05-17 11:26:45] [INFO ] Redundant transitions in 353 ms returned []
// Phase 1: matrix 5100 rows 2652 cols
[2021-05-17 11:26:45] [INFO ] Computed 51 place invariants in 36 ms
[2021-05-17 11:26:48] [INFO ] Dead Transitions using invariants and state equation in 2380 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2652/3116 places, 5100/5578 transitions.
Stuttering acceptance computed with spot in 548 ms :[true, (NOT p0)]
Running random walk in product with property : CANConstruction-PT-050-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}]], initial=1, aps=[p0:(LEQ s1601 s299)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 13001 steps with 38 reset in 136 ms.
FORMULA CANConstruction-PT-050-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-08 finished in 28945 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0 U p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 3116 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3116/3116 places, 5578/5578 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 3104 transition count 5554
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 3104 transition count 5554
Applied a total of 24 rules in 432 ms. Remains 3104 /3116 variables (removed 12) and now considering 5554/5578 (removed 24) transitions.
// Phase 1: matrix 5554 rows 3104 cols
[2021-05-17 11:26:49] [INFO ] Computed 51 place invariants in 28 ms
[2021-05-17 11:26:51] [INFO ] Implicit Places using invariants in 1740 ms returned []
// Phase 1: matrix 5554 rows 3104 cols
[2021-05-17 11:26:51] [INFO ] Computed 51 place invariants in 28 ms
[2021-05-17 11:26:51] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2021-05-17 11:27:15] [INFO ] Implicit Places using invariants and state equation in 24210 ms returned []
Implicit Place search using SMT with State Equation took 25953 ms to find 0 implicit places.
// Phase 1: matrix 5554 rows 3104 cols
[2021-05-17 11:27:15] [INFO ] Computed 51 place invariants in 28 ms
[2021-05-17 11:27:18] [INFO ] Dead Transitions using invariants and state equation in 2776 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3104/3116 places, 5554/5578 transitions.
Stuttering acceptance computed with spot in 3880 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : CANConstruction-PT-050-09 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p1:(LEQ s1173 s1970), p0:(LEQ s2577 s2572)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 2082 ms.
Product exploration explored 100000 steps with 33333 reset in 2061 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Product exploration explored 100000 steps with 33333 reset in 2020 ms.
Product exploration explored 100000 steps with 33333 reset in 2030 ms.
Applying partial POR strategy [true, false, true, false]
Stuttering acceptance computed with spot in 550 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Support contains 4 out of 3104 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 3104/3104 places, 5554/5554 transitions.
Performed 200 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 3104 transition count 5554
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 50 Pre rules applied. Total rules applied 200 place count 3104 transition count 5554
Deduced a syphon composed of 250 places in 2 ms
Iterating global reduction 1 with 50 rules applied. Total rules applied 250 place count 3104 transition count 5554
Discarding 100 places :
Symmetric choice reduction at 1 with 100 rule applications. Total rules 350 place count 3004 transition count 5454
Deduced a syphon composed of 150 places in 1 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 450 place count 3004 transition count 5454
Performed 200 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 350 places in 1 ms
Iterating global reduction 1 with 200 rules applied. Total rules applied 650 place count 3004 transition count 5454
Discarding 250 places :
Symmetric choice reduction at 1 with 250 rule applications. Total rules 900 place count 2754 transition count 5204
Deduced a syphon composed of 100 places in 1 ms
Iterating global reduction 1 with 250 rules applied. Total rules applied 1150 place count 2754 transition count 5204
Deduced a syphon composed of 100 places in 1 ms
Applied a total of 1150 rules in 931 ms. Remains 2754 /3104 variables (removed 350) and now considering 5204/5554 (removed 350) transitions.
[2021-05-17 11:27:35] [INFO ] Redundant transitions in 241 ms returned []
// Phase 1: matrix 5204 rows 2754 cols
[2021-05-17 11:27:35] [INFO ] Computed 51 place invariants in 42 ms
[2021-05-17 11:27:37] [INFO ] Dead Transitions using invariants and state equation in 2556 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2754/3104 places, 5204/5554 transitions.
Product exploration timeout after 75640 steps with 25213 reset in 10001 ms.
Product exploration timeout after 76120 steps with 25373 reset in 10001 ms.
[2021-05-17 11:27:58] [INFO ] Flatten gal took : 141 ms
[2021-05-17 11:27:58] [INFO ] Flatten gal took : 144 ms
[2021-05-17 11:28:00] [INFO ] Time to serialize gal into /tmp/LTL235445352314207992.gal : 2509 ms
[2021-05-17 11:28:00] [INFO ] Time to serialize properties into /tmp/LTL7220997631072185720.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/LTL235445352314207992.gal, -t, CGAL, -LTL, /tmp/LTL7220997631072185720.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/LTL235445352314207992.gal -t CGAL -LTL /tmp/LTL7220997631072185720.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(("(Node39GiveAnswer12<=Node39requestsent8)")U("(Node10GiveAnswer31<=Node26requestsent44)")))))
Formula 0 simplified : !XX("(Node39GiveAnswer12<=Node39requestsent8)" U "(Node10GiveAnswer31<=Node26requestsent44)")
Detected timeout of ITS tools.
[2021-05-17 11:28:15] [INFO ] Flatten gal took : 140 ms
[2021-05-17 11:28:15] [INFO ] Applying decomposition
[2021-05-17 11:28:16] [INFO ] Flatten gal took : 143 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/graph11389774023145295366.txt, -o, /tmp/graph11389774023145295366.bin, -w, /tmp/graph11389774023145295366.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/graph11389774023145295366.bin, -l, -1, -v, -w, /tmp/graph11389774023145295366.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 11:28:16] [INFO ] Decomposing Gal with order
[2021-05-17 11:28:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 11:28:17] [INFO ] Removed a total of 4951 redundant transitions.
[2021-05-17 11:28:17] [INFO ] Flatten gal took : 675 ms
[2021-05-17 11:28:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 4796 labels/synchronizations in 355 ms.
[2021-05-17 11:28:17] [INFO ] Time to serialize gal into /tmp/LTL10160325807917136673.gal : 19 ms
[2021-05-17 11:28:17] [INFO ] Time to serialize properties into /tmp/LTL15235575080035882423.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/LTL10160325807917136673.gal, -t, CGAL, -LTL, /tmp/LTL15235575080035882423.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/LTL10160325807917136673.gal -t CGAL -LTL /tmp/LTL15235575080035882423.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(("(gu226.Node39GiveAnswer12<=gu226.Node39requestsent8)")U("(gu225.Node10GiveAnswer31<=gu225.Node26requestsent44)")))))
Formula 0 simplified : !XX("(gu226.Node39GiveAnswer12<=gu226.Node39requestsent8)" U "(gu225.Node10GiveAnswer31<=gu225.Node26requestsent44)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13154886827988508967
[2021-05-17 11:28:32] [INFO ] Built C files in 84ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13154886827988508967
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/ltsmin13154886827988508967]
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/ltsmin13154886827988508967] 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/ltsmin13154886827988508967] 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 CANConstruction-PT-050-09 finished in 105092 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((F(p0)&&F(G(p1))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 3116 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3116/3116 places, 5578/5578 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 3104 transition count 5554
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 3104 transition count 5554
Applied a total of 24 rules in 424 ms. Remains 3104 /3116 variables (removed 12) and now considering 5554/5578 (removed 24) transitions.
// Phase 1: matrix 5554 rows 3104 cols
[2021-05-17 11:28:34] [INFO ] Computed 51 place invariants in 28 ms
[2021-05-17 11:28:36] [INFO ] Implicit Places using invariants in 1818 ms returned []
// Phase 1: matrix 5554 rows 3104 cols
[2021-05-17 11:28:36] [INFO ] Computed 51 place invariants in 28 ms
[2021-05-17 11:28:37] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2021-05-17 11:29:01] [INFO ] Implicit Places using invariants and state equation in 25216 ms returned []
Implicit Place search using SMT with State Equation took 27036 ms to find 0 implicit places.
// Phase 1: matrix 5554 rows 3104 cols
[2021-05-17 11:29:01] [INFO ] Computed 51 place invariants in 28 ms
[2021-05-17 11:29:04] [INFO ] Dead Transitions using invariants and state equation in 2799 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3104/3116 places, 5554/5578 transitions.
Stuttering acceptance computed with spot in 7692 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-050-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s1618 s1968), p1:(LEQ 1 s2399)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 886 steps with 0 reset in 7 ms.
FORMULA CANConstruction-PT-050-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-10 finished in 37976 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((F(p0) U p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 3116 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3116/3116 places, 5578/5578 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 3102 transition count 5550
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 3102 transition count 5550
Applied a total of 28 rules in 445 ms. Remains 3102 /3116 variables (removed 14) and now considering 5550/5578 (removed 28) transitions.
// Phase 1: matrix 5550 rows 3102 cols
[2021-05-17 11:29:12] [INFO ] Computed 51 place invariants in 28 ms
[2021-05-17 11:29:14] [INFO ] Implicit Places using invariants in 1762 ms returned []
// Phase 1: matrix 5550 rows 3102 cols
[2021-05-17 11:29:14] [INFO ] Computed 51 place invariants in 28 ms
[2021-05-17 11:29:15] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2021-05-17 11:29:37] [INFO ] Implicit Places using invariants and state equation in 23646 ms returned []
Implicit Place search using SMT with State Equation took 25409 ms to find 0 implicit places.
// Phase 1: matrix 5550 rows 3102 cols
[2021-05-17 11:29:37] [INFO ] Computed 51 place invariants in 59 ms
[2021-05-17 11:29:40] [INFO ] Dead Transitions using invariants and state equation in 2760 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3102/3116 places, 5550/5578 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-050-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s1783 s2679), p0:(LEQ 1 s1602)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 35604 steps with 40 reset in 257 ms.
FORMULA CANConstruction-PT-050-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-15 finished in 28995 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15503229880626951050
[2021-05-17 11:29:41] [INFO ] Too many transitions (5578) to apply POR reductions. Disabling POR matrices.
[2021-05-17 11:29:41] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15503229880626951050
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/ltsmin15503229880626951050]
[2021-05-17 11:29:41] [INFO ] Applying decomposition
[2021-05-17 11:29:41] [INFO ] Flatten gal took : 138 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/graph6130036817446464433.txt, -o, /tmp/graph6130036817446464433.bin, -w, /tmp/graph6130036817446464433.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/graph6130036817446464433.bin, -l, -1, -v, -w, /tmp/graph6130036817446464433.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 11:29:41] [INFO ] Decomposing Gal with order
[2021-05-17 11:29:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 11:29:42] [INFO ] Removed a total of 5026 redundant transitions.
[2021-05-17 11:29:42] [INFO ] Flatten gal took : 668 ms
[2021-05-17 11:29:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 4878 labels/synchronizations in 348 ms.
[2021-05-17 11:29:43] [INFO ] Time to serialize gal into /tmp/LTLCardinality2776953839119137559.gal : 19 ms
[2021-05-17 11:29:43] [INFO ] Time to serialize properties into /tmp/LTLCardinality2333293445765714108.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/LTLCardinality2776953839119137559.gal, -t, CGAL, -LTL, /tmp/LTLCardinality2333293445765714108.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/LTLCardinality2776953839119137559.gal -t CGAL -LTL /tmp/LTLCardinality2333293445765714108.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 3 LTL properties
Checking formula 0 : !((G(F(("(gu0.EmptyCAN<=gu0.Node21GiveAnswer1)")||(G("(gu257.Node11requestsent10>gu257.Node3requestsent41)"))))))
Formula 0 simplified : !GF("(gu0.EmptyCAN<=gu0.Node21GiveAnswer1)" | G"(gu257.Node11requestsent10>gu257.Node3requestsent41)")
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/ltsmin15503229880626951050] killed by timeout after 32 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/ltsmin15503229880626951050] killed by timeout after 32 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-17 11:52:47] [INFO ] Flatten gal took : 653 ms
[2021-05-17 11:52:47] [INFO ] Time to serialize gal into /tmp/LTLCardinality17979737517681054324.gal : 98 ms
[2021-05-17 11:52:47] [INFO ] Time to serialize properties into /tmp/LTLCardinality17645302363672731739.ltl : 27 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/LTLCardinality17979737517681054324.gal, -t, CGAL, -LTL, /tmp/LTLCardinality17645302363672731739.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/LTLCardinality17979737517681054324.gal -t CGAL -LTL /tmp/LTLCardinality17645302363672731739.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 3 LTL properties
Checking formula 0 : !((G(F(("(EmptyCAN<=Node21GiveAnswer1)")||(G("(Node11requestsent10>Node3requestsent41)"))))))
Formula 0 simplified : !GF("(EmptyCAN<=Node21GiveAnswer1)" | G"(Node11requestsent10>Node3requestsent41)")
Detected timeout of ITS tools.
[2021-05-17 12:15:53] [INFO ] Flatten gal took : 1157 ms
[2021-05-17 12:15:55] [INFO ] Input system was already deterministic with 5578 transitions.
[2021-05-17 12:15:55] [INFO ] Transformed 3116 places.
[2021-05-17 12:15:55] [INFO ] Transformed 5578 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-17 12:16:06] [INFO ] Time to serialize gal into /tmp/LTLCardinality7018330819946906874.gal : 15 ms
[2021-05-17 12:16:06] [INFO ] Time to serialize properties into /tmp/LTLCardinality6259807705221560803.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/LTLCardinality7018330819946906874.gal, -t, CGAL, -LTL, /tmp/LTLCardinality6259807705221560803.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/LTLCardinality7018330819946906874.gal -t CGAL -LTL /tmp/LTLCardinality6259807705221560803.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 : !((G(F(("(EmptyCAN<=Node21GiveAnswer1)")||(G("(Node11requestsent10>Node3requestsent41)"))))))
Formula 0 simplified : !GF("(EmptyCAN<=Node21GiveAnswer1)" | G"(Node11requestsent10>Node3requestsent41)")

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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="CANConstruction-PT-050"
export BK_EXAMINATION="LTLCardinality"
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 CANConstruction-PT-050, examination is LTLCardinality"
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-162124155900044"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-050.tgz
mv CANConstruction-PT-050 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;