fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r140-tall-162089128200612
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for Peterson-PT-3

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
830.720 90992.00 61204.00 17271.30 FFFFFTTFTFFFFTFT normal

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.r140-tall-162089128200612.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 Peterson-PT-3, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089128200612
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 132K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 555K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 104K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 464K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 16K Mar 28 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Mar 28 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 21K Mar 28 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 77K Mar 28 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Mar 27 06:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 59K Mar 27 06:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Mar 25 08:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Mar 25 08:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.5K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 253K May 5 16:51 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 Peterson-PT-3-00
FORMULA_NAME Peterson-PT-3-01
FORMULA_NAME Peterson-PT-3-02
FORMULA_NAME Peterson-PT-3-03
FORMULA_NAME Peterson-PT-3-04
FORMULA_NAME Peterson-PT-3-05
FORMULA_NAME Peterson-PT-3-06
FORMULA_NAME Peterson-PT-3-07
FORMULA_NAME Peterson-PT-3-08
FORMULA_NAME Peterson-PT-3-09
FORMULA_NAME Peterson-PT-3-10
FORMULA_NAME Peterson-PT-3-11
FORMULA_NAME Peterson-PT-3-12
FORMULA_NAME Peterson-PT-3-13
FORMULA_NAME Peterson-PT-3-14
FORMULA_NAME Peterson-PT-3-15

=== Now, execution of the tool begins

BK_START 1621019597316

Running Version 0
[2021-05-14 19:13:27] [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-14 19:13:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 19:13:27] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2021-05-14 19:13:27] [INFO ] Transformed 244 places.
[2021-05-14 19:13:27] [INFO ] Transformed 332 transitions.
[2021-05-14 19:13:27] [INFO ] Found NUPN structural information;
[2021-05-14 19:13:27] [INFO ] Parsed PT model containing 244 places and 332 transitions in 110 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2021-05-14 19:13:27] [INFO ] Initial state test concluded for 4 properties.
FORMULA Peterson-PT-3-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 214 out of 244 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 12 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2021-05-14 19:13:27] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2021-05-14 19:13:27] [INFO ] Computed 15 place invariants in 22 ms
[2021-05-14 19:13:28] [INFO ] Implicit Places using invariants in 220 ms returned []
[2021-05-14 19:13:28] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2021-05-14 19:13:28] [INFO ] Computed 15 place invariants in 4 ms
[2021-05-14 19:13:28] [INFO ] State equation strengthened by 66 read => feed constraints.
[2021-05-14 19:13:28] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 453 ms to find 0 implicit places.
[2021-05-14 19:13:28] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2021-05-14 19:13:28] [INFO ] Computed 15 place invariants in 4 ms
[2021-05-14 19:13:28] [INFO ] Dead Transitions using invariants and state equation in 193 ms returned []
Finished structural reductions, in 1 iterations. Remains : 244/244 places, 332/332 transitions.
[2021-05-14 19:13:28] [INFO ] Flatten gal took : 77 ms
[2021-05-14 19:13:28] [INFO ] Flatten gal took : 26 ms
[2021-05-14 19:13:28] [INFO ] Input system was already deterministic with 332 transitions.
Finished random walk after 34863 steps, including 1 resets, run visited all 17 properties in 153 ms. (steps per millisecond=227 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(p0)&&G((G(F(p1)) U p0))))], workingDir=/home/mcc/execution]
Support contains 60 out of 244 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 16 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2021-05-14 19:13:29] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2021-05-14 19:13:29] [INFO ] Computed 15 place invariants in 3 ms
[2021-05-14 19:13:29] [INFO ] Implicit Places using invariants in 114 ms returned [230, 231, 232, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 119 ms to find 4 implicit places.
[2021-05-14 19:13:29] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 240 cols
[2021-05-14 19:13:29] [INFO ] Computed 11 place invariants in 3 ms
[2021-05-14 19:13:29] [INFO ] Dead Transitions using invariants and state equation in 172 ms returned []
Starting structural reductions, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 12 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2021-05-14 19:13:29] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 240 cols
[2021-05-14 19:13:29] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-14 19:13:29] [INFO ] Dead Transitions using invariants and state equation in 147 ms returned []
Finished structural reductions, in 2 iterations. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 299 ms :[(NOT p0), (NOT p0), (NOT p1), (NOT p1), (NOT p0), (NOT p0), true]
Running random walk in product with property : Peterson-PT-3-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}, { cond=(NOT p0), acceptance={} source=0 dest: 4}, { cond=true, acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={} source=1 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(NOT p0), acceptance={0} source=4 dest: 3}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(NOT p0), acceptance={} source=5 dest: 3}, { cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s46 s47 s48)), p1:(LEQ (ADD s144 s145 s146 s147 s148 s165 s166 s167 s168 s170 s171 s172) (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s46 s47 s48))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 18 steps with 1 reset in 1 ms.
FORMULA Peterson-PT-3-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-3-00 finished in 833 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 12 out of 244 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 14 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2021-05-14 19:13:29] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2021-05-14 19:13:29] [INFO ] Computed 15 place invariants in 2 ms
[2021-05-14 19:13:30] [INFO ] Implicit Places using invariants in 85 ms returned [230, 231, 232, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 86 ms to find 4 implicit places.
[2021-05-14 19:13:30] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 240 cols
[2021-05-14 19:13:30] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 19:13:30] [INFO ] Dead Transitions using invariants and state equation in 184 ms returned []
Starting structural reductions, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 5 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2021-05-14 19:13:30] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 240 cols
[2021-05-14 19:13:30] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-14 19:13:30] [INFO ] Dead Transitions using invariants and state equation in 155 ms returned []
Finished structural reductions, in 2 iterations. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-3-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ 1 (ADD s45 s49 s50 s51 s52 s53 s54 s55 s56 s58 s59 s60))], 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][false, false, false]]
Product exploration explored 100000 steps with 8536 reset in 339 ms.
Stack based approach found an accepted trace after 449 steps with 37 reset with depth 11 and stack size 11 in 2 ms.
FORMULA Peterson-PT-3-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-3-01 finished in 882 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&(p1||F(p2)))))], workingDir=/home/mcc/execution]
Support contains 64 out of 244 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2021-05-14 19:13:30] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2021-05-14 19:13:30] [INFO ] Computed 15 place invariants in 2 ms
[2021-05-14 19:13:30] [INFO ] Implicit Places using invariants in 96 ms returned [230, 231, 232, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 97 ms to find 4 implicit places.
[2021-05-14 19:13:30] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 240 cols
[2021-05-14 19:13:30] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-14 19:13:31] [INFO ] Dead Transitions using invariants and state equation in 162 ms returned []
Starting structural reductions, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2021-05-14 19:13:31] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 240 cols
[2021-05-14 19:13:31] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-14 19:13:31] [INFO ] Dead Transitions using invariants and state equation in 171 ms returned []
Finished structural reductions, in 2 iterations. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true]
Running random walk in product with property : Peterson-PT-3-03 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p2:(LEQ 2 (ADD s144 s145 s146 s147 s148 s165 s166 s167 s168 s170 s171 s172)), p0:(LEQ (ADD s57 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101 s103 s104 s105 s106 s107 s108) (ADD s233 s234 s235 s237)), p1:(LEQ 1 (ADD s57 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101 s103 s104 s105 s106 s107 s108))], 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 11286 reset in 261 ms.
Stack based approach found an accepted trace after 1037 steps with 124 reset with depth 16 and stack size 16 in 3 ms.
FORMULA Peterson-PT-3-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-3-03 finished in 819 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((!p0||X(F((!p0&&F((p1 U (p2||G(p1)))))))))))], workingDir=/home/mcc/execution]
Support contains 64 out of 244 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 244 transition count 296
Reduce places removed 36 places and 0 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Iterating post reduction 1 with 72 rules applied. Total rules applied 108 place count 208 transition count 260
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 144 place count 172 transition count 260
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 144 place count 172 transition count 248
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 168 place count 160 transition count 248
Applied a total of 168 rules in 31 ms. Remains 160 /244 variables (removed 84) and now considering 248/332 (removed 84) transitions.
[2021-05-14 19:13:31] [INFO ] Flow matrix only has 224 transitions (discarded 24 similar events)
// Phase 1: matrix 224 rows 160 cols
[2021-05-14 19:13:31] [INFO ] Computed 15 place invariants in 6 ms
[2021-05-14 19:13:31] [INFO ] Implicit Places using invariants in 74 ms returned []
[2021-05-14 19:13:31] [INFO ] Flow matrix only has 224 transitions (discarded 24 similar events)
// Phase 1: matrix 224 rows 160 cols
[2021-05-14 19:13:31] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-14 19:13:31] [INFO ] State equation strengthened by 66 read => feed constraints.
[2021-05-14 19:13:31] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
[2021-05-14 19:13:31] [INFO ] Redundant transitions in 10 ms returned []
[2021-05-14 19:13:31] [INFO ] Flow matrix only has 224 transitions (discarded 24 similar events)
// Phase 1: matrix 224 rows 160 cols
[2021-05-14 19:13:32] [INFO ] Computed 15 place invariants in 11 ms
[2021-05-14 19:13:32] [INFO ] Dead Transitions using invariants and state equation in 114 ms returned []
Finished structural reductions, in 1 iterations. Remains : 160/244 places, 248/332 transitions.
Stuttering acceptance computed with spot in 197 ms :[p0, (AND (NOT p2) (NOT p1) p0), p0]
Running random walk in product with property : Peterson-PT-3-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={1} source=1 dest: 1}], [{ cond=p0, acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GT 1 (ADD s45 s49 s50 s51 s52 s53 s54 s55 s56 s58 s59 s60)) (GT (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s46 s47 s48) (ADD s146 s147 s148 s149))), p1:(GT (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s46 s47 s48) (ADD s146 s147 s148 s149)), p0:(LEQ 1 (ADD s45 s49 s50 s51 s52 s53 s54 s55 s56 s58 s59 s60))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 3504 reset in 742 ms.
Stack based approach found an accepted trace after 53 steps with 2 reset with depth 16 and stack size 16 in 1 ms.
FORMULA Peterson-PT-3-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-3-04 finished in 1410 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 52 out of 244 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2021-05-14 19:13:33] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2021-05-14 19:13:33] [INFO ] Computed 15 place invariants in 2 ms
[2021-05-14 19:13:33] [INFO ] Implicit Places using invariants in 85 ms returned [230, 231, 232, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 86 ms to find 4 implicit places.
[2021-05-14 19:13:33] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 240 cols
[2021-05-14 19:13:33] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 19:13:33] [INFO ] Dead Transitions using invariants and state equation in 171 ms returned []
Starting structural reductions, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2021-05-14 19:13:33] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 240 cols
[2021-05-14 19:13:33] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 19:13:33] [INFO ] Dead Transitions using invariants and state equation in 170 ms returned []
Finished structural reductions, in 2 iterations. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 10301 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-3-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 (ADD s233 s234 s235 s237) (ADD s57 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101 s103 s104 s105 s106 s107 s108))], 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 340 ms.
Product exploration explored 100000 steps with 50000 reset in 346 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 314 ms.
Product exploration explored 100000 steps with 50000 reset in 362 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Support contains 52 out of 240 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 240/240 places, 332/332 transitions.
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 240 transition count 332
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 51 place count 240 transition count 356
Deduced a syphon composed of 59 places in 1 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 59 place count 240 transition count 356
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 62 place count 237 transition count 353
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 65 place count 237 transition count 353
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 74 place count 237 transition count 353
Deduced a syphon composed of 65 places in 0 ms
Applied a total of 74 rules in 31 ms. Remains 237 /240 variables (removed 3) and now considering 353/332 (removed -21) transitions.
[2021-05-14 19:13:45] [INFO ] Redundant transitions in 5 ms returned []
[2021-05-14 19:13:45] [INFO ] Flow matrix only has 329 transitions (discarded 24 similar events)
// Phase 1: matrix 329 rows 237 cols
[2021-05-14 19:13:45] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 19:13:45] [INFO ] Dead Transitions using invariants and state equation in 154 ms returned []
Finished structural reductions, in 1 iterations. Remains : 237/240 places, 353/332 transitions.
Product exploration explored 100000 steps with 50000 reset in 1272 ms.
Product exploration explored 100000 steps with 50000 reset in 1247 ms.
[2021-05-14 19:13:48] [INFO ] Flatten gal took : 29 ms
[2021-05-14 19:13:48] [INFO ] Flatten gal took : 16 ms
[2021-05-14 19:13:48] [INFO ] Time to serialize gal into /tmp/LTL5718883873636074004.gal : 8 ms
[2021-05-14 19:13:48] [INFO ] Time to serialize properties into /tmp/LTL4196157006594909057.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/LTL5718883873636074004.gal, -t, CGAL, -LTL, /tmp/LTL4196157006594909057.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/LTL5718883873636074004.gal -t CGAL -LTL /tmp/LTL4196157006594909057.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((((CS_3+CS_1)+CS_2)+CS_0)<=(((((((((((((((((((((((((((((((((((((((((((((((BeginLoop_0_0_0+BeginLoop_1_1_0)+BeginLoop_2_1_0)+BeginLoop_3_1_0)+BeginLoop_0_2_0)+BeginLoop_1_0_0)+BeginLoop_2_0_0)+BeginLoop_3_0_0)+BeginLoop_0_1_0)+BeginLoop_1_0_1)+BeginLoop_2_0_1)+BeginLoop_3_0_1)+BeginLoop_0_1_1)+BeginLoop_1_2_0)+BeginLoop_2_2_0)+BeginLoop_3_2_0)+BeginLoop_0_0_1)+BeginLoop_2_2_1)+BeginLoop_1_2_1)+BeginLoop_0_0_2)+BeginLoop_3_2_1)+BeginLoop_2_1_1)+BeginLoop_1_1_1)+BeginLoop_0_2_1)+BeginLoop_3_1_1)+BeginLoop_2_1_2)+BeginLoop_1_1_2)+BeginLoop_0_2_2)+BeginLoop_3_1_2)+BeginLoop_2_0_2)+BeginLoop_1_0_2)+BeginLoop_0_1_2)+BeginLoop_3_0_2)+BeginLoop_3_0_3)+BeginLoop_0_1_3)+BeginLoop_1_0_3)+BeginLoop_2_0_3)+BeginLoop_3_2_2)+BeginLoop_0_0_3)+BeginLoop_1_2_2)+BeginLoop_2_2_2)+BeginLoop_3_2_3)+BeginLoop_1_2_3)+BeginLoop_2_2_3)+BeginLoop_3_1_3)+BeginLoop_0_2_3)+BeginLoop_1_1_3)+BeginLoop_2_1_3))"))))
Formula 0 simplified : !XF"((((CS_3+CS_1)+CS_2)+CS_0)<=(((((((((((((((((((((((((((((((((((((((((((((((BeginLoop_0_0_0+BeginLoop_1_1_0)+BeginLoop_2_1_0)+BeginLoop_3_1_0)+BeginLoop_0_2_0)+BeginLoop_1_0_0)+BeginLoop_2_0_0)+BeginLoop_3_0_0)+BeginLoop_0_1_0)+BeginLoop_1_0_1)+BeginLoop_2_0_1)+BeginLoop_3_0_1)+BeginLoop_0_1_1)+BeginLoop_1_2_0)+BeginLoop_2_2_0)+BeginLoop_3_2_0)+BeginLoop_0_0_1)+BeginLoop_2_2_1)+BeginLoop_1_2_1)+BeginLoop_0_0_2)+BeginLoop_3_2_1)+BeginLoop_2_1_1)+BeginLoop_1_1_1)+BeginLoop_0_2_1)+BeginLoop_3_1_1)+BeginLoop_2_1_2)+BeginLoop_1_1_2)+BeginLoop_0_2_2)+BeginLoop_3_1_2)+BeginLoop_2_0_2)+BeginLoop_1_0_2)+BeginLoop_0_1_2)+BeginLoop_3_0_2)+BeginLoop_3_0_3)+BeginLoop_0_1_3)+BeginLoop_1_0_3)+BeginLoop_2_0_3)+BeginLoop_3_2_2)+BeginLoop_0_0_3)+BeginLoop_1_2_2)+BeginLoop_2_2_2)+BeginLoop_3_2_3)+BeginLoop_1_2_3)+BeginLoop_2_2_3)+BeginLoop_3_1_3)+BeginLoop_0_2_3)+BeginLoop_1_1_3)+BeginLoop_2_1_3))"
Detected timeout of ITS tools.
[2021-05-14 19:14:03] [INFO ] Flatten gal took : 16 ms
[2021-05-14 19:14:03] [INFO ] Applying decomposition
[2021-05-14 19:14:03] [INFO ] Flatten gal took : 16 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/graph839445073564225821.txt, -o, /tmp/graph839445073564225821.bin, -w, /tmp/graph839445073564225821.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/graph839445073564225821.bin, -l, -1, -v, -w, /tmp/graph839445073564225821.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 19:14:14] [INFO ] Decomposing Gal with order
[2021-05-14 19:14:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 19:14:14] [INFO ] Removed a total of 181 redundant transitions.
[2021-05-14 19:14:14] [INFO ] Flatten gal took : 89 ms
[2021-05-14 19:14:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 9 ms.
[2021-05-14 19:14:14] [INFO ] Time to serialize gal into /tmp/LTL2257272310764227807.gal : 8 ms
[2021-05-14 19:14:14] [INFO ] Time to serialize properties into /tmp/LTL8699429704983771309.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/LTL2257272310764227807.gal, -t, CGAL, -LTL, /tmp/LTL8699429704983771309.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/LTL2257272310764227807.gal -t CGAL -LTL /tmp/LTL8699429704983771309.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((((gu64.CS_3+gu64.CS_1)+gu64.CS_2)+gu64.CS_0)<=(((((((((((((((((((((((((((((((((((((((((((((((gu64.BeginLoop_0_0_0+gu64.BeginLoop_1_1_0)+gu64.BeginLoop_2_1_0)+gu64.BeginLoop_3_1_0)+gu64.BeginLoop_0_2_0)+gu64.BeginLoop_1_0_0)+gu64.BeginLoop_2_0_0)+gu64.BeginLoop_3_0_0)+gu64.BeginLoop_0_1_0)+gu64.BeginLoop_1_0_1)+gu64.BeginLoop_2_0_1)+gu64.BeginLoop_3_0_1)+gu64.BeginLoop_0_1_1)+gu64.BeginLoop_1_2_0)+gu64.BeginLoop_2_2_0)+gu64.BeginLoop_3_2_0)+gu64.BeginLoop_0_0_1)+gu64.BeginLoop_2_2_1)+gu64.BeginLoop_1_2_1)+gu64.BeginLoop_0_0_2)+gu64.BeginLoop_3_2_1)+gu64.BeginLoop_2_1_1)+gu64.BeginLoop_1_1_1)+gu64.BeginLoop_0_2_1)+gu64.BeginLoop_3_1_1)+gu64.BeginLoop_2_1_2)+gu64.BeginLoop_1_1_2)+gu64.BeginLoop_0_2_2)+gu64.BeginLoop_3_1_2)+gu64.BeginLoop_2_0_2)+gu64.BeginLoop_1_0_2)+gu64.BeginLoop_0_1_2)+gu64.BeginLoop_3_0_2)+gu64.BeginLoop_3_0_3)+gu64.BeginLoop_0_1_3)+gu64.BeginLoop_1_0_3)+gu64.BeginLoop_2_0_3)+gu64.BeginLoop_3_2_2)+gu64.BeginLoop_0_0_3)+gu64.BeginLoop_1_2_2)+gu64.BeginLoop_2_2_2)+gu64.BeginLoop_3_2_3)+gu64.BeginLoop_1_2_3)+gu64.BeginLoop_2_2_3)+gu64.BeginLoop_3_1_3)+gu64.BeginLoop_0_2_3)+gu64.BeginLoop_1_1_3)+gu64.BeginLoop_2_1_3))"))))
Formula 0 simplified : !XF"((((gu64.CS_3+gu64.CS_1)+gu64.CS_2)+gu64.CS_0)<=(((((((((((((((((((((((((((((((((((((((((((((((gu64.BeginLoop_0_0_0+gu64.BeginLoop_1_1_0)+gu64.BeginLoop_2_1_0)+gu64.BeginLoop_3_1_0)+gu64.BeginLoop_0_2_0)+gu64.BeginLoop_1_0_0)+gu64.BeginLoop_2_0_0)+gu64.BeginLoop_3_0_0)+gu64.BeginLoop_0_1_0)+gu64.BeginLoop_1_0_1)+gu64.BeginLoop_2_0_1)+gu64.BeginLoop_3_0_1)+gu64.BeginLoop_0_1_1)+gu64.BeginLoop_1_2_0)+gu64.BeginLoop_2_2_0)+gu64.BeginLoop_3_2_0)+gu64.BeginLoop_0_0_1)+gu64.BeginLoop_2_2_1)+gu64.BeginLoop_1_2_1)+gu64.BeginLoop_0_0_2)+gu64.BeginLoop_3_2_1)+gu64.BeginLoop_2_1_1)+gu64.BeginLoop_1_1_1)+gu64.BeginLoop_0_2_1)+gu64.BeginLoop_3_1_1)+gu64.BeginLoop_2_1_2)+gu64.BeginLoop_1_1_2)+gu64.BeginLoop_0_2_2)+gu64.BeginLoop_3_1_2)+gu64.BeginLoop_2_0_2)+gu64.BeginLoop_1_0_2)+gu64.BeginLoop_0_1_2)+gu64.BeginLoop_3_0_2)+gu64.BeginLoop_3_0_3)+gu64.BeginLoop_0_1_3)+gu64.BeginLoop_1_0_3)+gu64.BeginLoop_2_0_3)+gu64.BeginLoop_3_2_2)+gu64.BeginLoop_0_0_3)+gu64.BeginLoop_1_2_2)+gu64.BeginLoop_2_2_2)+gu64.BeginLoop_3_2_3)+gu64.BeginLoop_1_2_3)+gu64.BeginLoop_2_2_3)+gu64.BeginLoop_3_1_3)+gu64.BeginLoop_0_2_3)+gu64.BeginLoop_1_1_3)+gu64.BeginLoop_2_1_3))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7782404253873269353
[2021-05-14 19:14:29] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7782404253873269353
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/ltsmin7782404253873269353]
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/ltsmin7782404253873269353] 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/ltsmin7782404253873269353] 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 Peterson-PT-3-06 finished in 57876 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(((p0 U p1)||G(p2)))))], workingDir=/home/mcc/execution]
Support contains 136 out of 244 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 244/244 places, 332/332 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 244 transition count 320
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 232 transition count 320
Applied a total of 24 rules in 32 ms. Remains 232 /244 variables (removed 12) and now considering 320/332 (removed 12) transitions.
[2021-05-14 19:14:30] [INFO ] Flow matrix only has 296 transitions (discarded 24 similar events)
// Phase 1: matrix 296 rows 232 cols
[2021-05-14 19:14:30] [INFO ] Computed 15 place invariants in 2 ms
[2021-05-14 19:14:31] [INFO ] Implicit Places using invariants in 91 ms returned []
[2021-05-14 19:14:31] [INFO ] Flow matrix only has 296 transitions (discarded 24 similar events)
// Phase 1: matrix 296 rows 232 cols
[2021-05-14 19:14:31] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-14 19:14:31] [INFO ] State equation strengthened by 66 read => feed constraints.
[2021-05-14 19:14:31] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
[2021-05-14 19:14:31] [INFO ] Redundant transitions in 4 ms returned []
[2021-05-14 19:14:31] [INFO ] Flow matrix only has 296 transitions (discarded 24 similar events)
// Phase 1: matrix 296 rows 232 cols
[2021-05-14 19:14:31] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-14 19:14:31] [INFO ] Dead Transitions using invariants and state equation in 159 ms returned []
Finished structural reductions, in 1 iterations. Remains : 232/244 places, 320/332 transitions.
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : Peterson-PT-3-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p2:(GT (ADD s109 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s149 s150 s151 s152 s153 s154 s155 s156) (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s46 s47 s48)), p1:(LEQ (ADD s157 s158 s159 s160 s161 s162 s163 s164 s169 s173 s174 s175 s176 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s189 s190 s191 s192 s193 s194 s195 s196 s197 s198 s199 s200 s201 s202 s203 s204 s213 s214 s215 s217 s218 s219 s220) (ADD s225 s226 s227 s228))], 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 4606 reset in 370 ms.
Stack based approach found an accepted trace after 115 steps with 4 reset with depth 26 and stack size 26 in 1 ms.
FORMULA Peterson-PT-3-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-3-07 finished in 914 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 244 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2021-05-14 19:14:31] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2021-05-14 19:14:31] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-14 19:14:31] [INFO ] Implicit Places using invariants in 79 ms returned [230, 231, 232, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 80 ms to find 4 implicit places.
[2021-05-14 19:14:31] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 240 cols
[2021-05-14 19:14:31] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 19:14:32] [INFO ] Dead Transitions using invariants and state equation in 165 ms returned []
Starting structural reductions, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 5 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2021-05-14 19:14:32] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 240 cols
[2021-05-14 19:14:32] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-14 19:14:32] [INFO ] Dead Transitions using invariants and state equation in 160 ms returned []
Finished structural reductions, in 2 iterations. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-3-10 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:(OR (EQ s165 0) (EQ s116 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 209 steps with 0 reset in 1 ms.
FORMULA Peterson-PT-3-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-3-10 finished in 515 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||X(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 244 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2021-05-14 19:14:32] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2021-05-14 19:14:32] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-14 19:14:32] [INFO ] Implicit Places using invariants in 93 ms returned [230, 231, 233]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 95 ms to find 3 implicit places.
[2021-05-14 19:14:32] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 241 cols
[2021-05-14 19:14:32] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 19:14:32] [INFO ] Dead Transitions using invariants and state equation in 166 ms returned []
Starting structural reductions, iteration 1 : 241/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 241 /241 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2021-05-14 19:14:32] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 241 cols
[2021-05-14 19:14:32] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 19:14:32] [INFO ] Dead Transitions using invariants and state equation in 158 ms returned []
Finished structural reductions, in 2 iterations. Remains : 241/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), true]
Running random walk in product with property : Peterson-PT-3-11 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s68 0), p1:(OR (EQ s52 0) (EQ s230 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 175 steps with 0 reset in 1 ms.
FORMULA Peterson-PT-3-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-3-11 finished in 494 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&X(F(p0)))))], workingDir=/home/mcc/execution]
Support contains 1 out of 244 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2021-05-14 19:14:32] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2021-05-14 19:14:32] [INFO ] Computed 15 place invariants in 2 ms
[2021-05-14 19:14:32] [INFO ] Implicit Places using invariants in 92 ms returned [230, 231, 232, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 93 ms to find 4 implicit places.
[2021-05-14 19:14:32] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 240 cols
[2021-05-14 19:14:32] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-14 19:14:33] [INFO ] Dead Transitions using invariants and state equation in 162 ms returned []
Starting structural reductions, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2021-05-14 19:14:33] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 240 cols
[2021-05-14 19:14:33] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 19:14:33] [INFO ] Dead Transitions using invariants and state equation in 164 ms returned []
Finished structural reductions, in 2 iterations. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : Peterson-PT-3-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(EQ s115 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, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-3-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-3-12 finished in 514 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 244 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 0 with 95 rules applied. Total rules applied 95 place count 244 transition count 237
Reduce places removed 95 places and 0 transitions.
Iterating post reduction 1 with 95 rules applied. Total rules applied 190 place count 149 transition count 237
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 190 place count 149 transition count 190
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 284 place count 102 transition count 190
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 306 place count 91 transition count 179
Applied a total of 306 rules in 16 ms. Remains 91 /244 variables (removed 153) and now considering 179/332 (removed 153) transitions.
[2021-05-14 19:14:33] [INFO ] Flow matrix only has 155 transitions (discarded 24 similar events)
// Phase 1: matrix 155 rows 91 cols
[2021-05-14 19:14:33] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-14 19:14:33] [INFO ] Implicit Places using invariants in 83 ms returned [83, 84, 85, 86]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 84 ms to find 4 implicit places.
[2021-05-14 19:14:33] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-14 19:14:33] [INFO ] Flow matrix only has 155 transitions (discarded 24 similar events)
// Phase 1: matrix 155 rows 87 cols
[2021-05-14 19:14:33] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 19:14:33] [INFO ] Dead Transitions using invariants and state equation in 93 ms returned []
Starting structural reductions, iteration 1 : 87/244 places, 179/332 transitions.
Applied a total of 0 rules in 5 ms. Remains 87 /87 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2021-05-14 19:14:33] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-14 19:14:33] [INFO ] Flow matrix only has 155 transitions (discarded 24 similar events)
// Phase 1: matrix 155 rows 87 cols
[2021-05-14 19:14:33] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 19:14:33] [INFO ] Dead Transitions using invariants and state equation in 82 ms returned []
Finished structural reductions, in 2 iterations. Remains : 87/244 places, 179/332 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : Peterson-PT-3-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s57 0) (NEQ s32 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 133 ms.
Stack based approach found an accepted trace after 33 steps with 0 reset with depth 34 and stack size 34 in 0 ms.
FORMULA Peterson-PT-3-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-3-14 finished in 485 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1992037280740047770
[2021-05-14 19:14:33] [INFO ] Computing symmetric may disable matrix : 332 transitions.
[2021-05-14 19:14:33] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 19:14:33] [INFO ] Computing symmetric may enable matrix : 332 transitions.
[2021-05-14 19:14:33] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 19:14:33] [INFO ] Applying decomposition
[2021-05-14 19:14:33] [INFO ] Flatten gal took : 13 ms
[2021-05-14 19:14:33] [INFO ] Computing Do-Not-Accords matrix : 332 transitions.
[2021-05-14 19:14:33] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 19:14:33] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1992037280740047770
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/ltsmin1992037280740047770]
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/graph10087506631967730038.txt, -o, /tmp/graph10087506631967730038.bin, -w, /tmp/graph10087506631967730038.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/graph10087506631967730038.bin, -l, -1, -v, -w, /tmp/graph10087506631967730038.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 19:14:33] [INFO ] Decomposing Gal with order
[2021-05-14 19:14:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 19:14:33] [INFO ] Removed a total of 172 redundant transitions.
[2021-05-14 19:14:33] [INFO ] Flatten gal took : 60 ms
[2021-05-14 19:14:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 27 labels/synchronizations in 8 ms.
[2021-05-14 19:14:34] [INFO ] Time to serialize gal into /tmp/LTLCardinality6695980163075396072.gal : 3 ms
[2021-05-14 19:14:34] [INFO ] Time to serialize properties into /tmp/LTLCardinality4545504228992556358.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/LTLCardinality6695980163075396072.gal, -t, CGAL, -LTL, /tmp/LTLCardinality4545504228992556358.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/LTLCardinality6695980163075396072.gal -t CGAL -LTL /tmp/LTLCardinality4545504228992556358.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((((gu63.CS_3+gu63.CS_1)+gu63.CS_2)+gu63.CS_0)<=(((((((((((((((((((((((((((((((((((((((((((((((gu63.BeginLoop_0_0_0+gu63.BeginLoop_1_1_0)+gu63.BeginLoop_2_1_0)+gu63.BeginLoop_3_1_0)+gu63.BeginLoop_0_2_0)+gu63.BeginLoop_1_0_0)+gu63.BeginLoop_2_0_0)+gu63.BeginLoop_3_0_0)+gu63.BeginLoop_0_1_0)+gu63.BeginLoop_1_0_1)+gu63.BeginLoop_2_0_1)+gu63.BeginLoop_3_0_1)+gu63.BeginLoop_0_1_1)+gu63.BeginLoop_1_2_0)+gu63.BeginLoop_2_2_0)+gu63.BeginLoop_3_2_0)+gu63.BeginLoop_0_0_1)+gu63.BeginLoop_2_2_1)+gu63.BeginLoop_1_2_1)+gu63.BeginLoop_0_0_2)+gu63.BeginLoop_3_2_1)+gu63.BeginLoop_2_1_1)+gu63.BeginLoop_1_1_1)+gu63.BeginLoop_0_2_1)+gu63.BeginLoop_3_1_1)+gu63.BeginLoop_2_1_2)+gu63.BeginLoop_1_1_2)+gu63.BeginLoop_0_2_2)+gu63.BeginLoop_3_1_2)+gu63.BeginLoop_2_0_2)+gu63.BeginLoop_1_0_2)+gu63.BeginLoop_0_1_2)+gu63.BeginLoop_3_0_2)+gu63.BeginLoop_3_0_3)+gu63.BeginLoop_0_1_3)+gu63.BeginLoop_1_0_3)+gu63.BeginLoop_2_0_3)+gu63.BeginLoop_3_2_2)+gu63.BeginLoop_0_0_3)+gu63.BeginLoop_1_2_2)+gu63.BeginLoop_2_2_2)+gu63.BeginLoop_3_2_3)+gu63.BeginLoop_1_2_3)+gu63.BeginLoop_2_2_3)+gu63.BeginLoop_3_1_3)+gu63.BeginLoop_0_2_3)+gu63.BeginLoop_1_1_3)+gu63.BeginLoop_2_1_3))"))))
Formula 0 simplified : !XF"((((gu63.CS_3+gu63.CS_1)+gu63.CS_2)+gu63.CS_0)<=(((((((((((((((((((((((((((((((((((((((((((((((gu63.BeginLoop_0_0_0+gu63.BeginLoop_1_1_0)+gu63.BeginLoop_2_1_0)+gu63.BeginLoop_3_1_0)+gu63.BeginLoop_0_2_0)+gu63.BeginLoop_1_0_0)+gu63.BeginLoop_2_0_0)+gu63.BeginLoop_3_0_0)+gu63.BeginLoop_0_1_0)+gu63.BeginLoop_1_0_1)+gu63.BeginLoop_2_0_1)+gu63.BeginLoop_3_0_1)+gu63.BeginLoop_0_1_1)+gu63.BeginLoop_1_2_0)+gu63.BeginLoop_2_2_0)+gu63.BeginLoop_3_2_0)+gu63.BeginLoop_0_0_1)+gu63.BeginLoop_2_2_1)+gu63.BeginLoop_1_2_1)+gu63.BeginLoop_0_0_2)+gu63.BeginLoop_3_2_1)+gu63.BeginLoop_2_1_1)+gu63.BeginLoop_1_1_1)+gu63.BeginLoop_0_2_1)+gu63.BeginLoop_3_1_1)+gu63.BeginLoop_2_1_2)+gu63.BeginLoop_1_1_2)+gu63.BeginLoop_0_2_2)+gu63.BeginLoop_3_1_2)+gu63.BeginLoop_2_0_2)+gu63.BeginLoop_1_0_2)+gu63.BeginLoop_0_1_2)+gu63.BeginLoop_3_0_2)+gu63.BeginLoop_3_0_3)+gu63.BeginLoop_0_1_3)+gu63.BeginLoop_1_0_3)+gu63.BeginLoop_2_0_3)+gu63.BeginLoop_3_2_2)+gu63.BeginLoop_0_0_3)+gu63.BeginLoop_1_2_2)+gu63.BeginLoop_2_2_2)+gu63.BeginLoop_3_2_3)+gu63.BeginLoop_1_2_3)+gu63.BeginLoop_2_2_3)+gu63.BeginLoop_3_1_3)+gu63.BeginLoop_0_2_3)+gu63.BeginLoop_1_1_3)+gu63.BeginLoop_2_1_3))"
Compilation finished in 1562 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin1992037280740047770]
Link finished in 58 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin1992037280740047770]
LTSmin run took 549 ms.
FORMULA Peterson-PT-3-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1621019688308

--------------------
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="Peterson-PT-3"
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 Peterson-PT-3, 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 r140-tall-162089128200612"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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