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.r216-tall-162098204600125.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 SharedMemory-PT-000010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r216-tall-162098204600125
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 127K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 581K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 165K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 702K May 10 09:44 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 12K Mar 28 16:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Mar 28 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 26K Mar 28 16:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 93K Mar 28 16:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Mar 27 11:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 51K Mar 27 11:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Mar 25 14:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Mar 25 14:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.1K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 7 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 171K May 5 16:52 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 SharedMemory-PT-000010-00
FORMULA_NAME SharedMemory-PT-000010-01
FORMULA_NAME SharedMemory-PT-000010-02
FORMULA_NAME SharedMemory-PT-000010-03
FORMULA_NAME SharedMemory-PT-000010-04
FORMULA_NAME SharedMemory-PT-000010-05
FORMULA_NAME SharedMemory-PT-000010-06
FORMULA_NAME SharedMemory-PT-000010-07
FORMULA_NAME SharedMemory-PT-000010-08
FORMULA_NAME SharedMemory-PT-000010-09
FORMULA_NAME SharedMemory-PT-000010-10
FORMULA_NAME SharedMemory-PT-000010-11
FORMULA_NAME SharedMemory-PT-000010-12
FORMULA_NAME SharedMemory-PT-000010-13
FORMULA_NAME SharedMemory-PT-000010-14
FORMULA_NAME SharedMemory-PT-000010-15

=== Now, execution of the tool begins

BK_START 1621045325556

Running Version 0
[2021-05-15 02:22:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-15 02:22:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 02:22:11] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2021-05-15 02:22:11] [INFO ] Transformed 131 places.
[2021-05-15 02:22:11] [INFO ] Transformed 210 transitions.
[2021-05-15 02:22:11] [INFO ] Found NUPN structural information;
[2021-05-15 02:22:11] [INFO ] Parsed PT model containing 131 places and 210 transitions in 125 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Support contains 131 out of 131 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 10 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2021-05-15 02:22:11] [INFO ] Computed 21 place invariants in 21 ms
[2021-05-15 02:22:11] [INFO ] Implicit Places using invariants in 131 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2021-05-15 02:22:11] [INFO ] Computed 21 place invariants in 21 ms
[2021-05-15 02:22:11] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 131 cols
[2021-05-15 02:22:11] [INFO ] Computed 21 place invariants in 3 ms
[2021-05-15 02:22:12] [INFO ] Dead Transitions using invariants and state equation in 132 ms returned []
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 210/210 transitions.
[2021-05-15 02:22:12] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-15 02:22:12] [INFO ] Flatten gal took : 53 ms
FORMULA SharedMemory-PT-000010-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-15 02:22:12] [INFO ] Flatten gal took : 28 ms
[2021-05-15 02:22:12] [INFO ] Input system was already deterministic with 210 transitions.
Finished random walk after 1473 steps, including 0 resets, run visited all 26 properties in 25 ms. (steps per millisecond=58 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((G(p0) U (p1 U p2)))))], workingDir=/home/mcc/execution]
Support contains 100 out of 131 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 3 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2021-05-15 02:22:12] [INFO ] Computed 21 place invariants in 3 ms
[2021-05-15 02:22:12] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2021-05-15 02:22:12] [INFO ] Computed 21 place invariants in 2 ms
[2021-05-15 02:22:12] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 131 cols
[2021-05-15 02:22:12] [INFO ] Computed 21 place invariants in 10 ms
[2021-05-15 02:22:13] [INFO ] Dead Transitions using invariants and state equation in 150 ms returned []
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 285 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p0), (NOT p2)]
Running random walk in product with property : SharedMemory-PT-000010-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=2 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(OR (EQ s115 1) (EQ s101 1) (EQ s103 1) (EQ s116 1) (EQ s102 1) (EQ s106 1) (EQ s107 1) (EQ s104 1) (EQ s105 1) (EQ s108 1)), p0:(AND (NEQ s1 1) (NEQ s64 1) (NEQ s3 1) (NEQ s66 1) (NEQ s5 1) (NEQ s68 1) (NEQ s7 1) (NEQ s70 1) (NEQ s9 1) (NEQ s72 1) (NEQ s11 1) (NEQ s74 1) (NEQ s13 1) (NEQ s76 1) (NEQ s15 1) (NEQ s78 1) (NEQ s17 1) (NEQ s80 1) (NEQ s19 1) (NEQ s82 1) (NEQ s21 1) (NEQ s84 1) (NEQ s23 1) (NEQ s86 1) (NEQ s25 1) (NEQ s27 1) (NEQ s90 1) (NEQ s29 1) (NEQ s92 1) (NEQ s31 1) (NEQ s33 1) (NEQ s35 1) (NEQ s37 1) (NEQ s39 1) (NEQ s41 1) (NEQ s43 1) (NEQ s45 1) (NEQ s47 1) (NEQ s49 1) (NEQ s51 1) (NEQ s53 1) (NEQ s55 1) (NEQ s57 1) (NEQ s59 1) (NEQ s61 1) (NEQ s63 1) (NEQ s0 1) (NEQ s65 1) (NEQ s2 1) (NEQ s67 1) (NEQ s4 1) (NEQ s69 1) (NEQ s6 1) (NEQ s71 1) (NEQ s8 1) (NEQ s73 1) (NEQ s10 1) (NEQ s75 1) (NEQ s12 1) (NEQ s77 1) (NEQ s14 1) (NEQ s79 1) (NEQ s16 1) (NEQ s81 1) (NEQ s18 1) (NEQ s83 1) (NEQ s20 1) (NEQ s22 1) (NEQ s24 1) (NEQ s89 1) (NEQ s26 1) (NEQ s91 1) (NEQ s28 1) (NEQ s30 1) (NEQ s32 1) (NEQ s34 1) (NEQ s36 1) (NEQ s38 1) (NEQ s40 1) (NEQ s42 1) (NEQ s44 1) (NEQ s46 1) (NEQ s48 1) (NEQ s50 1) (NEQ s52 1) (NEQ s54 1) (NEQ s56 1) (NEQ s58 1) (NEQ s60 1) (NEQ s62 1) (OR (AND (NEQ s115 1) (NEQ s101 1) (NEQ s116 1) (NEQ s103 1) (NEQ s102 1) (NEQ s106 1) (NEQ s104 1) (NEQ s107 1) (NEQ s105 1) (NEQ s108 1)) (AND (NEQ s115 1) (NEQ s101 1) (NEQ s103 1) (NEQ s116 1) (NEQ s102 1) (NEQ s106 1) (NEQ s107 1) (NEQ s104 1) (NEQ s105 1) (NEQ s108 1)))), p1:(OR (EQ s1 1) (EQ s64 1) (EQ s3 1) (EQ s66 1) (EQ s5 1) (EQ s68 1) (EQ s7 1) (EQ s70 1) (EQ s9 1) (EQ s72 1) (EQ s11 1) (EQ s74 1) (EQ s13 1) (EQ s76 1) (EQ s15 1) (EQ s78 1) (EQ s17 1) (EQ s80 1) (EQ s19 1) (EQ s82 1) (EQ s21 1) (EQ s84 1) (EQ s23 1) (EQ s86 1) (EQ s25 1) (EQ s27 1) (EQ s90 1) (EQ s29 1) (EQ s92 1) (EQ s31 1) (EQ s33 1) (EQ s35 1) (EQ s37 1) (EQ s39 1) (EQ s41 1) (EQ s43 1) (EQ s45 1) (EQ s47 1) (EQ s49 1) (EQ s51 1) (EQ s53 1) (EQ s55 1) (EQ s57 1) (EQ s59 1) (EQ s61 1) (EQ s63 1) (EQ s0 1) (EQ s65 1) (EQ s2 1) (EQ s67 1) (EQ s4 1) (EQ s69 1) (EQ s6 1) (EQ s71 1) (EQ s8 1) (EQ s73 1) (EQ s10 1) (EQ s75 1) (EQ s12 1) (EQ s77 1) (EQ s14 1) (EQ s79 1) (EQ s16 1) (EQ s81 1) (EQ s18 1) (EQ s83 1) (EQ s20 1) (EQ s22 1) (EQ s24 1) (EQ s89 1) (EQ s26 1) (EQ s91 1) (EQ s28 1) (EQ s30 1) (EQ s32 1) (EQ s34 1) (EQ s36 1) (EQ s38 1) (EQ s40 1) (EQ s42 1) (EQ s44 1) (EQ s46 1) (EQ s48 1) (EQ s50 1) (EQ s52 1) (EQ s54 1) (EQ s56 1) (EQ s58 1) (EQ s60 1) (EQ s62 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 350 ms.
Product exploration explored 100000 steps with 33333 reset in 286 ms.
Knowledge obtained : [p2, (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 138 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p0), (NOT p2)]
Product exploration explored 100000 steps with 33333 reset in 215 ms.
Product exploration explored 100000 steps with 33333 reset in 276 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 141 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p0), (NOT p2)]
Support contains 100 out of 131 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 8 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2021-05-15 02:22:14] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2021-05-15 02:22:14] [INFO ] Computed 21 place invariants in 2 ms
[2021-05-15 02:22:15] [INFO ] Dead Transitions using invariants and state equation in 133 ms returned []
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 210/210 transitions.
Product exploration explored 100000 steps with 33333 reset in 712 ms.
Product exploration explored 100000 steps with 33333 reset in 647 ms.
[2021-05-15 02:22:16] [INFO ] Flatten gal took : 15 ms
[2021-05-15 02:22:16] [INFO ] Flatten gal took : 15 ms
[2021-05-15 02:22:16] [INFO ] Time to serialize gal into /tmp/LTL4651678575493069662.gal : 9 ms
[2021-05-15 02:22:16] [INFO ] Time to serialize properties into /tmp/LTL5606294231035844812.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/LTL4651678575493069662.gal, -t, CGAL, -LTL, /tmp/LTL5606294231035844812.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/LTL4651678575493069662.gal -t CGAL -LTL /tmp/LTL5606294231035844812.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X((G("(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((Ext_Mem_Acc_3_1==0)&&(Ext_Mem_Acc_6_8==0))&&(Ext_Mem_Acc_5_1==0))&&(Ext_Mem_Acc_10_7==0))&&(Ext_Mem_Acc_7_1==0))&&(Ext_Mem_Acc_2_8==0))&&(Ext_Mem_Acc_9_1==0))&&(Ext_Mem_Acc_3_9==0))&&(Ext_Mem_Acc_1_2==0))&&(Ext_Mem_Acc_5_9==0))&&(Ext_Mem_Acc_4_2==0))&&(Ext_Mem_Acc_9_8==0))&&(Ext_Mem_Acc_7_2==0))&&(Ext_Mem_Acc_1_9==0))&&(Ext_Mem_Acc_9_2==0))&&(Ext_Mem_Acc_1_10==0))&&(Ext_Mem_Acc_1_3==0))&&(Ext_Mem_Acc_3_10==0))&&(Ext_Mem_Acc_4_3==0))&&(Ext_Mem_Acc_6_9==0))&&(Ext_Mem_Acc_6_3==0))&&(Ext_Mem_Acc_8_9==0))&&(Ext_Mem_Acc_8_3==0))&&(Ext_Mem_Acc_9_10==0))&&(Ext_Mem_Acc_10_3==0))&&(Ext_Mem_Acc_2_4==0))&&(Ext_Mem_Acc_5_10==0))&&(Ext_Mem_Acc_6_4==0))&&(Ext_Mem_Acc_7_10==0))&&(Ext_Mem_Acc_3_4==0))&&(Ext_Mem_Acc_10_4==0))&&(Ext_Mem_Acc_8_4==0))&&(Ext_Mem_Acc_4_5==0))&&(Ext_Mem_Acc_2_5==0))&&(Ext_Mem_Acc_9_5==0))&&(Ext_Mem_Acc_7_5==0))&&(Ext_Mem_Acc_4_6==0))&&(Ext_Mem_Acc_2_6==0))&&(Ext_Mem_Acc_9_6==0))&&(Ext_Mem_Acc_7_6==0))&&(Ext_Mem_Acc_3_7==0))&&(Ext_Mem_Acc_1_7==0))&&(Ext_Mem_Acc_8_7==0))&&(Ext_Mem_Acc_5_7==0))&&(Ext_Mem_Acc_3_8==0))&&(Ext_Mem_Acc_5_8==0))&&(Ext_Mem_Acc_2_1==0))&&(Ext_Mem_Acc_9_7==0))&&(Ext_Mem_Acc_4_1==0))&&(Ext_Mem_Acc_1_8==0))&&(Ext_Mem_Acc_6_1==0))&&(Ext_Mem_Acc_2_9==0))&&(Ext_Mem_Acc_8_1==0))&&(Ext_Mem_Acc_4_9==0))&&(Ext_Mem_Acc_10_1==0))&&(Ext_Mem_Acc_7_8==0))&&(Ext_Mem_Acc_3_2==0))&&(Ext_Mem_Acc_10_8==0))&&(Ext_Mem_Acc_5_2==0))&&(Ext_Mem_Acc_2_10==0))&&(Ext_Mem_Acc_6_2==0))&&(Ext_Mem_Acc_4_10==0))&&(Ext_Mem_Acc_8_2==0))&&(Ext_Mem_Acc_7_9==0))&&(Ext_Mem_Acc_10_2==0))&&(Ext_Mem_Acc_10_9==0))&&(Ext_Mem_Acc_2_3==0))&&(Ext_Mem_Acc_5_3==0))&&(Ext_Mem_Acc_7_3==0))&&(Ext_Mem_Acc_6_10==0))&&(Ext_Mem_Acc_9_3==0))&&(Ext_Mem_Acc_8_10==0))&&(Ext_Mem_Acc_1_4==0))&&(Ext_Mem_Acc_7_4==0))&&(Ext_Mem_Acc_5_4==0))&&(Ext_Mem_Acc_1_5==0))&&(Ext_Mem_Acc_9_4==0))&&(Ext_Mem_Acc_6_5==0))&&(Ext_Mem_Acc_3_5==0))&&(Ext_Mem_Acc_10_5==0))&&(Ext_Mem_Acc_8_5==0))&&(Ext_Mem_Acc_3_6==0))&&(Ext_Mem_Acc_1_6==0))&&(Ext_Mem_Acc_8_6==0))&&(Ext_Mem_Acc_5_6==0))&&(Ext_Mem_Acc_2_7==0))&&(Ext_Mem_Acc_10_6==0))&&(Ext_Mem_Acc_6_7==0))&&(Ext_Mem_Acc_4_7==0))&&(Ext_Mem_Acc_4_8==0))&&(((((((((((Active_10==0)&&(Active_7==0))&&(Active_9==0))&&(Active_5==0))&&(Active_8==0))&&(Active_4==0))&&(Active_6==0))&&(Active_1==0))&&(Active_3==0))&&(Active_2==0))||((((((((((Active_10==0)&&(Active_7==0))&&(Active_5==0))&&(Active_9==0))&&(Active_8==0))&&(Active_4==0))&&(Active_1==0))&&(Active_6==0))&&(Active_3==0))&&(Active_2==0))))"))U(("((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((Ext_Mem_Acc_3_1==1)||(Ext_Mem_Acc_6_8==1))||(Ext_Mem_Acc_5_1==1))||(Ext_Mem_Acc_10_7==1))||(Ext_Mem_Acc_7_1==1))||(Ext_Mem_Acc_2_8==1))||(Ext_Mem_Acc_9_1==1))||(Ext_Mem_Acc_3_9==1))||(Ext_Mem_Acc_1_2==1))||(Ext_Mem_Acc_5_9==1))||(Ext_Mem_Acc_4_2==1))||(Ext_Mem_Acc_9_8==1))||(Ext_Mem_Acc_7_2==1))||(Ext_Mem_Acc_1_9==1))||(Ext_Mem_Acc_9_2==1))||(Ext_Mem_Acc_1_10==1))||(Ext_Mem_Acc_1_3==1))||(Ext_Mem_Acc_3_10==1))||(Ext_Mem_Acc_4_3==1))||(Ext_Mem_Acc_6_9==1))||(Ext_Mem_Acc_6_3==1))||(Ext_Mem_Acc_8_9==1))||(Ext_Mem_Acc_8_3==1))||(Ext_Mem_Acc_9_10==1))||(Ext_Mem_Acc_10_3==1))||(Ext_Mem_Acc_2_4==1))||(Ext_Mem_Acc_5_10==1))||(Ext_Mem_Acc_6_4==1))||(Ext_Mem_Acc_7_10==1))||(Ext_Mem_Acc_3_4==1))||(Ext_Mem_Acc_10_4==1))||(Ext_Mem_Acc_8_4==1))||(Ext_Mem_Acc_4_5==1))||(Ext_Mem_Acc_2_5==1))||(Ext_Mem_Acc_9_5==1))||(Ext_Mem_Acc_7_5==1))||(Ext_Mem_Acc_4_6==1))||(Ext_Mem_Acc_2_6==1))||(Ext_Mem_Acc_9_6==1))||(Ext_Mem_Acc_7_6==1))||(Ext_Mem_Acc_3_7==1))||(Ext_Mem_Acc_1_7==1))||(Ext_Mem_Acc_8_7==1))||(Ext_Mem_Acc_5_7==1))||(Ext_Mem_Acc_3_8==1))||(Ext_Mem_Acc_5_8==1))||(Ext_Mem_Acc_2_1==1))||(Ext_Mem_Acc_9_7==1))||(Ext_Mem_Acc_4_1==1))||(Ext_Mem_Acc_1_8==1))||(Ext_Mem_Acc_6_1==1))||(Ext_Mem_Acc_2_9==1))||(Ext_Mem_Acc_8_1==1))||(Ext_Mem_Acc_4_9==1))||(Ext_Mem_Acc_10_1==1))||(Ext_Mem_Acc_7_8==1))||(Ext_Mem_Acc_3_2==1))||(Ext_Mem_Acc_10_8==1))||(Ext_Mem_Acc_5_2==1))||(Ext_Mem_Acc_2_10==1))||(Ext_Mem_Acc_6_2==1))||(Ext_Mem_Acc_4_10==1))||(Ext_Mem_Acc_8_2==1))||(Ext_Mem_Acc_7_9==1))||(Ext_Mem_Acc_10_2==1))||(Ext_Mem_Acc_10_9==1))||(Ext_Mem_Acc_2_3==1))||(Ext_Mem_Acc_5_3==1))||(Ext_Mem_Acc_7_3==1))||(Ext_Mem_Acc_6_10==1))||(Ext_Mem_Acc_9_3==1))||(Ext_Mem_Acc_8_10==1))||(Ext_Mem_Acc_1_4==1))||(Ext_Mem_Acc_7_4==1))||(Ext_Mem_Acc_5_4==1))||(Ext_Mem_Acc_1_5==1))||(Ext_Mem_Acc_9_4==1))||(Ext_Mem_Acc_6_5==1))||(Ext_Mem_Acc_3_5==1))||(Ext_Mem_Acc_10_5==1))||(Ext_Mem_Acc_8_5==1))||(Ext_Mem_Acc_3_6==1))||(Ext_Mem_Acc_1_6==1))||(Ext_Mem_Acc_8_6==1))||(Ext_Mem_Acc_5_6==1))||(Ext_Mem_Acc_2_7==1))||(Ext_Mem_Acc_10_6==1))||(Ext_Mem_Acc_6_7==1))||(Ext_Mem_Acc_4_7==1))||(Ext_Mem_Acc_4_8==1))")U("((((((((((Active_10==1)||(Active_7==1))||(Active_5==1))||(Active_9==1))||(Active_8==1))||(Active_4==1))||(Active_1==1))||(Active_6==1))||(Active_3==1))||(Active_2==1))"))))))
Formula 0 simplified : !XX(G"(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((Ext_Mem_Acc_3_1==0)&&(Ext_Mem_Acc_6_8==0))&&(Ext_Mem_Acc_5_1==0))&&(Ext_Mem_Acc_10_7==0))&&(Ext_Mem_Acc_7_1==0))&&(Ext_Mem_Acc_2_8==0))&&(Ext_Mem_Acc_9_1==0))&&(Ext_Mem_Acc_3_9==0))&&(Ext_Mem_Acc_1_2==0))&&(Ext_Mem_Acc_5_9==0))&&(Ext_Mem_Acc_4_2==0))&&(Ext_Mem_Acc_9_8==0))&&(Ext_Mem_Acc_7_2==0))&&(Ext_Mem_Acc_1_9==0))&&(Ext_Mem_Acc_9_2==0))&&(Ext_Mem_Acc_1_10==0))&&(Ext_Mem_Acc_1_3==0))&&(Ext_Mem_Acc_3_10==0))&&(Ext_Mem_Acc_4_3==0))&&(Ext_Mem_Acc_6_9==0))&&(Ext_Mem_Acc_6_3==0))&&(Ext_Mem_Acc_8_9==0))&&(Ext_Mem_Acc_8_3==0))&&(Ext_Mem_Acc_9_10==0))&&(Ext_Mem_Acc_10_3==0))&&(Ext_Mem_Acc_2_4==0))&&(Ext_Mem_Acc_5_10==0))&&(Ext_Mem_Acc_6_4==0))&&(Ext_Mem_Acc_7_10==0))&&(Ext_Mem_Acc_3_4==0))&&(Ext_Mem_Acc_10_4==0))&&(Ext_Mem_Acc_8_4==0))&&(Ext_Mem_Acc_4_5==0))&&(Ext_Mem_Acc_2_5==0))&&(Ext_Mem_Acc_9_5==0))&&(Ext_Mem_Acc_7_5==0))&&(Ext_Mem_Acc_4_6==0))&&(Ext_Mem_Acc_2_6==0))&&(Ext_Mem_Acc_9_6==0))&&(Ext_Mem_Acc_7_6==0))&&(Ext_Mem_Acc_3_7==0))&&(Ext_Mem_Acc_1_7==0))&&(Ext_Mem_Acc_8_7==0))&&(Ext_Mem_Acc_5_7==0))&&(Ext_Mem_Acc_3_8==0))&&(Ext_Mem_Acc_5_8==0))&&(Ext_Mem_Acc_2_1==0))&&(Ext_Mem_Acc_9_7==0))&&(Ext_Mem_Acc_4_1==0))&&(Ext_Mem_Acc_1_8==0))&&(Ext_Mem_Acc_6_1==0))&&(Ext_Mem_Acc_2_9==0))&&(Ext_Mem_Acc_8_1==0))&&(Ext_Mem_Acc_4_9==0))&&(Ext_Mem_Acc_10_1==0))&&(Ext_Mem_Acc_7_8==0))&&(Ext_Mem_Acc_3_2==0))&&(Ext_Mem_Acc_10_8==0))&&(Ext_Mem_Acc_5_2==0))&&(Ext_Mem_Acc_2_10==0))&&(Ext_Mem_Acc_6_2==0))&&(Ext_Mem_Acc_4_10==0))&&(Ext_Mem_Acc_8_2==0))&&(Ext_Mem_Acc_7_9==0))&&(Ext_Mem_Acc_10_2==0))&&(Ext_Mem_Acc_10_9==0))&&(Ext_Mem_Acc_2_3==0))&&(Ext_Mem_Acc_5_3==0))&&(Ext_Mem_Acc_7_3==0))&&(Ext_Mem_Acc_6_10==0))&&(Ext_Mem_Acc_9_3==0))&&(Ext_Mem_Acc_8_10==0))&&(Ext_Mem_Acc_1_4==0))&&(Ext_Mem_Acc_7_4==0))&&(Ext_Mem_Acc_5_4==0))&&(Ext_Mem_Acc_1_5==0))&&(Ext_Mem_Acc_9_4==0))&&(Ext_Mem_Acc_6_5==0))&&(Ext_Mem_Acc_3_5==0))&&(Ext_Mem_Acc_10_5==0))&&(Ext_Mem_Acc_8_5==0))&&(Ext_Mem_Acc_3_6==0))&&(Ext_Mem_Acc_1_6==0))&&(Ext_Mem_Acc_8_6==0))&&(Ext_Mem_Acc_5_6==0))&&(Ext_Mem_Acc_2_7==0))&&(Ext_Mem_Acc_10_6==0))&&(Ext_Mem_Acc_6_7==0))&&(Ext_Mem_Acc_4_7==0))&&(Ext_Mem_Acc_4_8==0))&&(((((((((((Active_10==0)&&(Active_7==0))&&(Active_9==0))&&(Active_5==0))&&(Active_8==0))&&(Active_4==0))&&(Active_6==0))&&(Active_1==0))&&(Active_3==0))&&(Active_2==0))||((((((((((Active_10==0)&&(Active_7==0))&&(Active_5==0))&&(Active_9==0))&&(Active_8==0))&&(Active_4==0))&&(Active_1==0))&&(Active_6==0))&&(Active_3==0))&&(Active_2==0))))" U ("((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((Ext_Mem_Acc_3_1==1)||(Ext_Mem_Acc_6_8==1))||(Ext_Mem_Acc_5_1==1))||(Ext_Mem_Acc_10_7==1))||(Ext_Mem_Acc_7_1==1))||(Ext_Mem_Acc_2_8==1))||(Ext_Mem_Acc_9_1==1))||(Ext_Mem_Acc_3_9==1))||(Ext_Mem_Acc_1_2==1))||(Ext_Mem_Acc_5_9==1))||(Ext_Mem_Acc_4_2==1))||(Ext_Mem_Acc_9_8==1))||(Ext_Mem_Acc_7_2==1))||(Ext_Mem_Acc_1_9==1))||(Ext_Mem_Acc_9_2==1))||(Ext_Mem_Acc_1_10==1))||(Ext_Mem_Acc_1_3==1))||(Ext_Mem_Acc_3_10==1))||(Ext_Mem_Acc_4_3==1))||(Ext_Mem_Acc_6_9==1))||(Ext_Mem_Acc_6_3==1))||(Ext_Mem_Acc_8_9==1))||(Ext_Mem_Acc_8_3==1))||(Ext_Mem_Acc_9_10==1))||(Ext_Mem_Acc_10_3==1))||(Ext_Mem_Acc_2_4==1))||(Ext_Mem_Acc_5_10==1))||(Ext_Mem_Acc_6_4==1))||(Ext_Mem_Acc_7_10==1))||(Ext_Mem_Acc_3_4==1))||(Ext_Mem_Acc_10_4==1))||(Ext_Mem_Acc_8_4==1))||(Ext_Mem_Acc_4_5==1))||(Ext_Mem_Acc_2_5==1))||(Ext_Mem_Acc_9_5==1))||(Ext_Mem_Acc_7_5==1))||(Ext_Mem_Acc_4_6==1))||(Ext_Mem_Acc_2_6==1))||(Ext_Mem_Acc_9_6==1))||(Ext_Mem_Acc_7_6==1))||(Ext_Mem_Acc_3_7==1))||(Ext_Mem_Acc_1_7==1))||(Ext_Mem_Acc_8_7==1))||(Ext_Mem_Acc_5_7==1))||(Ext_Mem_Acc_3_8==1))||(Ext_Mem_Acc_5_8==1))||(Ext_Mem_Acc_2_1==1))||(Ext_Mem_Acc_9_7==1))||(Ext_Mem_Acc_4_1==1))||(Ext_Mem_Acc_1_8==1))||(Ext_Mem_Acc_6_1==1))||(Ext_Mem_Acc_2_9==1))||(Ext_Mem_Acc_8_1==1))||(Ext_Mem_Acc_4_9==1))||(Ext_Mem_Acc_10_1==1))||(Ext_Mem_Acc_7_8==1))||(Ext_Mem_Acc_3_2==1))||(Ext_Mem_Acc_10_8==1))||(Ext_Mem_Acc_5_2==1))||(Ext_Mem_Acc_2_10==1))||(Ext_Mem_Acc_6_2==1))||(Ext_Mem_Acc_4_10==1))||(Ext_Mem_Acc_8_2==1))||(Ext_Mem_Acc_7_9==1))||(Ext_Mem_Acc_10_2==1))||(Ext_Mem_Acc_10_9==1))||(Ext_Mem_Acc_2_3==1))||(Ext_Mem_Acc_5_3==1))||(Ext_Mem_Acc_7_3==1))||(Ext_Mem_Acc_6_10==1))||(Ext_Mem_Acc_9_3==1))||(Ext_Mem_Acc_8_10==1))||(Ext_Mem_Acc_1_4==1))||(Ext_Mem_Acc_7_4==1))||(Ext_Mem_Acc_5_4==1))||(Ext_Mem_Acc_1_5==1))||(Ext_Mem_Acc_9_4==1))||(Ext_Mem_Acc_6_5==1))||(Ext_Mem_Acc_3_5==1))||(Ext_Mem_Acc_10_5==1))||(Ext_Mem_Acc_8_5==1))||(Ext_Mem_Acc_3_6==1))||(Ext_Mem_Acc_1_6==1))||(Ext_Mem_Acc_8_6==1))||(Ext_Mem_Acc_5_6==1))||(Ext_Mem_Acc_2_7==1))||(Ext_Mem_Acc_10_6==1))||(Ext_Mem_Acc_6_7==1))||(Ext_Mem_Acc_4_7==1))||(Ext_Mem_Acc_4_8==1))" U "((((((((((Active_10==1)||(Active_7==1))||(Active_5==1))||(Active_9==1))||(Active_8==1))||(Active_4==1))||(Active_1==1))||(Active_6==1))||(Active_3==1))||(Active_2==1))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
254 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.5642,94640,1,0,7,429270,33,0,4611,53904,16
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA SharedMemory-PT-000010-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property SharedMemory-PT-000010-00 finished in 7400 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0 U (p1||G(p0))))))], workingDir=/home/mcc/execution]
Support contains 31 out of 131 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 14 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2021-05-15 02:22:20] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-15 02:22:20] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2021-05-15 02:22:20] [INFO ] Computed 21 place invariants in 2 ms
[2021-05-15 02:22:20] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2021-05-15 02:22:20] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2021-05-15 02:22:20] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-15 02:22:20] [INFO ] Dead Transitions using invariants and state equation in 117 ms returned []
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SharedMemory-PT-000010-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 (NOT p1) p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NEQ s115 1) (NEQ s101 1) (NEQ s103 1) (NEQ s116 1) (NEQ s102 1) (NEQ s106 1) (NEQ s107 1) (NEQ s104 1) (NEQ s105 1) (NEQ s108 1) (OR (NEQ s85 1) (NEQ s97 1) (NEQ s109 1)) (OR (NEQ s85 1) (NEQ s88 1) (NEQ s121 1)) (OR (NEQ s85 1) (NEQ s97 1) (NEQ s111 1)) (OR (NEQ s85 1) (NEQ s98 1) (NEQ s113 1)) (OR (NEQ s85 1) (NEQ s93 1) (NEQ s124 1)) (OR (NEQ s85 1) (NEQ s97 1) (NEQ s113 1)) (OR (NEQ s85 1) (NEQ s87 1) (NEQ s111 1)) (OR (NEQ s85 1) (NEQ s98 1) (NEQ s111 1)) (OR (NEQ s85 1) (NEQ s93 1) (NEQ s110 1)) (OR (NEQ s85 1) (NEQ s87 1) (NEQ s109 1)) (OR (NEQ s85 1) (NEQ s88 1) (NEQ s123 1)) (OR (NEQ s85 1) (NEQ s93 1) (NEQ s112 1)) (OR (NEQ s85 1) (NEQ s99 1) (NEQ s121 1)) (OR (NEQ s85 1) (NEQ s93 1) (NEQ s114 1)) (OR (NEQ s85 1) (NEQ s99 1) (NEQ s123 1)) (OR (NEQ s85 1) (NEQ s97 1) (NEQ s121 1)) (OR (NEQ s85 1) (NEQ s97 1) (NEQ s123 1)) (OR (NEQ s85 1) (NEQ s94 1) (NEQ s114 1)) (OR (NEQ s85 1) (NEQ s99 1) (NEQ s113 1)) (OR (NEQ s85 1) (NEQ s94 1) (NEQ s112 1)) (OR (NEQ s85 1) (NEQ s94 1) (NEQ s110 1)) (OR (NEQ s85 1) (NEQ s99 1) (NEQ s109 1)) (OR (NEQ s85 1) (NEQ s94 1) (NEQ s124 1)) (OR (NEQ s85 1) (NEQ s99 1) (NEQ s111 1)) (OR (NEQ s85 1) (NEQ s94 1) (NEQ s122 1)) (OR (NEQ s85 1) (NEQ s98 1) (NEQ s123 1)) (OR (NEQ s85 1) (NEQ s98 1) (NEQ s121 1)) (OR (NEQ s85 1) (NEQ s100 1) (NEQ s114 1)) (OR (NEQ s85 1) (NEQ s95 1) (NEQ s113 1)) (OR (NEQ s85 1) (NEQ s100 1) (NEQ s112 1)) (OR (NEQ s85 1) (NEQ s95 1) (NEQ s109 1)) (OR (NEQ s85 1) (NEQ s95 1) (NEQ s111 1)) (OR (NEQ s85 1) (NEQ s95 1) (NEQ s121 1)) (OR (NEQ s85 1) (NEQ s95 1) (NEQ s123 1)) (OR (NEQ s85 1) (NEQ s100 1) (NEQ s110 1)) (OR (NEQ s85 1) (NEQ s96 1) (NEQ s109 1)) (OR (NEQ s85 1) (NEQ s87 1) (NEQ s123 1)) (OR (NEQ s85 1) (NEQ s96 1) (NEQ s113 1)) (OR (NEQ s85 1) (NEQ s87 1) (NEQ s121 1)) (OR (NEQ s85 1) (NEQ s96 1) (NEQ s111 1)) (OR (NEQ s85 1) (NEQ s100 1) (NEQ s122 1)) (OR (NEQ s85 1) (NEQ s88 1) (NEQ s109 1)) (OR (NEQ s85 1) (NEQ s96 1) (NEQ s121 1)) (OR (NEQ s85 1) (NEQ s88 1) (NEQ s111 1)) (OR (NEQ s85 1) (NEQ s100 1) (NEQ s124 1)) (OR (NEQ s85 1) (NEQ s88 1) (NEQ s113 1)) (OR (NEQ s85 1) (NEQ s93 1) (NEQ s121 1)) (OR (NEQ s85 1) (NEQ s88 1) (NEQ s122 1)) (OR (NEQ s85 1) (NEQ s93 1) (NEQ s123 1)) (OR (NEQ s85 1) (NEQ s97 1) (NEQ s112 1)) (OR (NEQ s85 1) (NEQ s98 1) (NEQ s114 1)) (OR (NEQ s85 1) (NEQ s97 1) (NEQ s114 1)) (OR (NEQ s85 1) (NEQ s87 1) (NEQ s110 1)) (OR (NEQ s85 1) (NEQ s99 1) (NEQ s124 1)) (OR (NEQ s85 1) (NEQ s98 1) (NEQ s112 1)) (OR (NEQ s85 1) (NEQ s93 1) (NEQ s111 1)) (OR (NEQ s85 1) (NEQ s88 1) (NEQ s124 1)) (OR (NEQ s85 1) (NEQ s98 1) (NEQ s110 1)) (OR (NEQ s85 1) (NEQ s93 1) (NEQ s113 1)) (OR (NEQ s85 1) (NEQ s87 1) (NEQ s114 1)) (OR (NEQ s85 1) (NEQ s87 1) (NEQ s112 1)) (OR (NEQ s85 1) (NEQ s99 1) (NEQ s122 1)) (OR (NEQ s85 1) (NEQ s97 1) (NEQ s122 1)) (OR (NEQ s85 1) (NEQ s97 1) (NEQ s124 1)) (OR (NEQ s85 1) (NEQ s94 1) (NEQ s113 1)) (OR (NEQ s85 1) (NEQ s94 1) (NEQ s111 1)) (OR (NEQ s85 1) (NEQ s99 1) (NEQ s114 1)) (OR (NEQ s85 1) (NEQ s94 1) (NEQ s109 1)) (OR (NEQ s85 1) (NEQ s94 1) (NEQ s123 1)) (OR (NEQ s85 1) (NEQ s99 1) (NEQ s110 1)) (OR (NEQ s85 1) (NEQ s98 1) (NEQ s124 1)) (OR (NEQ s85 1) (NEQ s98 1) (NEQ s122 1)) (OR (NEQ s85 1) (NEQ s95 1) (NEQ s112 1)) (OR (NEQ s85 1) (NEQ s100 1) (NEQ s113 1)) (OR (NEQ s85 1) (NEQ s95 1) (NEQ s114 1)) (OR (NEQ s85 1) (NEQ s96 1) (NEQ s124 1)) (OR (NEQ s85 1) (NEQ s95 1) (NEQ s110 1)) (OR (NEQ s85 1) (NEQ s95 1) (NEQ s122 1)) (OR (NEQ s85 1) (NEQ s100 1) (NEQ s109 1)) (OR (NEQ s85 1) (NEQ s96 1) (NEQ s110 1)) (OR (NEQ s85 1) (NEQ s87 1) (NEQ s122 1)) (OR (NEQ s85 1) (NEQ s96 1) (NEQ s114 1)) (OR (NEQ s85 1) (NEQ s96 1) (NEQ s112 1)) (OR (NEQ s85 1) (NEQ s93 1) (NEQ s109 1)) (OR (NEQ s85 1) (NEQ s100 1) (NEQ s121 1)) (OR (NEQ s85 1) (NEQ s88 1) (NEQ s110 1)) (OR (NEQ s85 1) (NEQ s87 1) (NEQ s124 1)) (OR (NEQ s85 1) (NEQ s88 1) (NEQ s112 1)) (OR (NEQ s85 1) (NEQ s96 1) (NEQ s122 1)) (OR (NEQ s85 1) (NEQ s100 1) (NEQ s123 1))), p0:(AND (OR (NEQ s85 1) (NEQ s97 1) (NEQ s109 1)) (OR (NEQ s85 1) (NEQ s88 1) (NEQ s121 1)) (OR (NEQ s85 1) (NEQ s97 1) (NEQ s111 1)) (OR (NEQ s85 1) (NEQ s98 1) (NEQ s113 1)) (OR (NEQ s85 1) (NEQ s93 1) (NEQ s124 1)) (OR (NEQ s85 1) (NEQ s97 1) (NEQ s113 1)) (OR (NEQ s85 1) (NEQ s87 1) (NEQ s111 1)) (OR (NEQ s85 1) (NEQ s98 1) (NEQ s111 1)) (OR (NEQ s85 1) (NEQ s93 1) (NEQ s110 1)) (OR (NEQ s85 1) (NEQ s87 1) (NEQ s109 1)) (OR (NEQ s85 1) (NEQ s88 1) (NEQ s123 1)) (OR (NEQ s85 1) (NEQ s93 1) (NEQ s112 1)) (OR (NEQ s85 1) (NEQ s99 1) (NEQ s121 1)) (OR (NEQ s85 1) (NEQ s93 1) (NEQ s114 1)) (OR (NEQ s85 1) (NEQ s99 1) (NEQ s123 1)) (OR (NEQ s85 1) (NEQ s97 1) (NEQ s121 1)) (OR (NEQ s85 1) (NEQ s97 1) (NEQ s123 1)) (OR (NEQ s85 1) (NEQ s94 1) (NEQ s114 1)) (OR (NEQ s85 1) (NEQ s99 1) (NEQ s113 1)) (OR (NEQ s85 1) (NEQ s94 1) (NEQ s112 1)) (OR (NEQ s85 1) (NEQ s94 1) (NEQ s110 1)) (OR (NEQ s85 1) (NEQ s99 1) (NEQ s109 1)) (OR (NEQ s85 1) (NEQ s94 1) (NEQ s124 1)) (OR (NEQ s85 1) (NEQ s99 1) (NEQ s111 1)) (OR (NEQ s85 1) (NEQ s94 1) (NEQ s122 1)) (OR (NEQ s85 1) (NEQ s98 1) (NEQ s123 1)) (OR (NEQ s85 1) (NEQ s98 1) (NEQ s121 1)) (OR (NEQ s85 1) (NEQ s100 1) (NEQ s114 1)) (OR (NEQ s85 1) (NEQ s95 1) (NEQ s113 1)) (OR (NEQ s85 1) (NEQ s100 1) (NEQ s112 1)) (OR (NEQ s85 1) (NEQ s95 1) (NEQ s109 1)) (OR (NEQ s85 1) (NEQ s95 1) (NEQ s111 1)) (OR (NEQ s85 1) (NEQ s95 1) (NEQ s121 1)) (OR (NEQ s85 1) (NEQ s95 1) (NEQ s123 1)) (OR (NEQ s85 1) (NEQ s100 1) (NEQ s110 1)) (OR (NEQ s85 1) (NEQ s96 1) (NEQ s109 1)) (OR (NEQ s85 1) (NEQ s87 1) (NEQ s123 1)) (OR (NEQ s85 1) (NEQ s96 1) (NEQ s113 1)) (OR (NEQ s85 1) (NEQ s87 1) (NEQ s121 1)) (OR (NEQ s85 1) (NEQ s96 1) (NEQ s111 1)) (OR (NEQ s85 1) (NEQ s100 1) (NEQ s122 1)) (OR (NEQ s85 1) (NEQ s88 1) (NEQ s109 1)) (OR (NEQ s85 1) (NEQ s96 1) (NEQ s121 1)) (OR (NEQ s85 1) (NEQ s88 1) (NEQ s111 1)) (OR (NEQ s85 1) (NEQ s100 1) (NEQ s124 1)) (OR (NEQ s85 1) (NEQ s88 1) (NEQ s113 1)) (OR (NEQ s85 1) (NEQ s93 1) (NEQ s121 1)) (OR (NEQ s85 1) (NEQ s88 1) (NEQ s122 1)) (OR (NEQ s85 1) (NEQ s93 1) (NEQ s123 1)) (OR (NEQ s85 1) (NEQ s97 1) (NEQ s112 1)) (OR (NEQ s85 1) (NEQ s98 1) (NEQ s114 1)) (OR (NEQ s85 1) (NEQ s97 1) (NEQ s114 1)) (OR (NEQ s85 1) (NEQ s87 1) (NEQ s110 1)) (OR (NEQ s85 1) (NEQ s99 1) (NEQ s124 1)) (OR (NEQ s85 1) (NEQ s98 1) (NEQ s112 1)) (OR (NEQ s85 1) (NEQ s93 1) (NEQ s111 1)) (OR (NEQ s85 1) (NEQ s88 1) (NEQ s124 1)) (OR (NEQ s85 1) (NEQ s98 1) (NEQ s110 1)) (OR (NEQ s85 1) (NEQ s93 1) (NEQ s113 1)) (OR (NEQ s85 1) (NEQ s87 1) (NEQ s114 1)) (OR (NEQ s85 1) (NEQ s87 1) (NEQ s112 1)) (OR (NEQ s85 1) (NEQ s99 1) (NEQ s122 1)) (OR (NEQ s85 1) (NEQ s97 1) (NEQ s122 1)) (OR (NEQ s85 1) (NEQ s97 1) (NEQ s124 1)) (OR (NEQ s85 1) (NEQ s94 1) (NEQ s113 1)) (OR (NEQ s85 1) (NEQ s94 1) (NEQ s111 1)) (OR (NEQ s85 1) (NEQ s99 1) (NEQ s114 1)) (OR (NEQ s85 1) (NEQ s94 1) (NEQ s109 1)) (OR (NEQ s85 1) (NEQ s94 1) (NEQ s123 1)) (OR (NEQ s85 1) (NEQ s99 1) (NEQ s110 1)) (OR (NEQ s85 1) (NEQ s98 1) (NEQ s124 1)) (OR (NEQ s85 1) (NEQ s98 1) (NEQ s122 1)) (OR (NEQ s85 1) (NEQ s95 1) (NEQ s112 1)) (OR (NEQ s85 1) (NEQ s100 1) (NEQ s113 1)) (OR (NEQ s85 1) (NEQ s95 1) (NEQ s114 1)) (OR (NEQ s85 1) (NEQ s96 1) (NEQ s124 1)) (OR (NEQ s85 1) (NEQ s95 1) (NEQ s110 1)) (OR (NEQ s85 1) (NEQ s95 1) (NEQ s122 1)) (OR (NEQ s85 1) (NEQ s100 1) (NEQ s109 1)) (OR (NEQ s85 1) (NEQ s96 1) (NEQ s110 1)) (OR (NEQ s85 1) (NEQ s87 1) (NEQ s122 1)) (OR (NEQ s85 1) (NEQ s96 1) (NEQ s114 1)) (OR (NEQ s85 1) (NEQ s96 1) (NEQ s112 1)) (OR (NEQ s85 1) (NEQ s93 1) (NEQ s109 1)) (OR (NEQ s85 1) (NEQ s100 1) (NEQ s121 1)) (OR (NEQ s85 1) (NEQ s88 1) (NEQ s110 1)) (OR (NEQ s85 1) (NEQ s87 1) (NEQ s124 1)) (OR (NEQ s85 1) (NEQ s88 1) (NEQ s112 1)) (OR (NEQ s85 1) (NEQ s96 1) (NEQ s122 1)) (OR (NEQ s85 1) (NEQ s100 1) (NEQ s123 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3124 reset in 969 ms.
Stack based approach found an accepted trace after 69 steps with 2 reset with depth 13 and stack size 13 in 1 ms.
FORMULA SharedMemory-PT-000010-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-PT-000010-01 finished in 1303 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(!p0)))], workingDir=/home/mcc/execution]
Support contains 21 out of 131 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 12 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2021-05-15 02:22:21] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-15 02:22:21] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2021-05-15 02:22:21] [INFO ] Computed 21 place invariants in 7 ms
[2021-05-15 02:22:21] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2021-05-15 02:22:21] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2021-05-15 02:22:21] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-15 02:22:21] [INFO ] Dead Transitions using invariants and state equation in 101 ms returned []
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 25 ms :[p0]
Running random walk in product with property : SharedMemory-PT-000010-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (NEQ s85 1) (NEQ s97 1) (NEQ s109 1)) (OR (NEQ s85 1) (NEQ s88 1) (NEQ s121 1)) (OR (NEQ s85 1) (NEQ s97 1) (NEQ s111 1)) (OR (NEQ s85 1) (NEQ s98 1) (NEQ s113 1)) (OR (NEQ s85 1) (NEQ s93 1) (NEQ s124 1)) (OR (NEQ s85 1) (NEQ s97 1) (NEQ s113 1)) (OR (NEQ s85 1) (NEQ s87 1) (NEQ s111 1)) (OR (NEQ s85 1) (NEQ s98 1) (NEQ s111 1)) (OR (NEQ s85 1) (NEQ s93 1) (NEQ s110 1)) (OR (NEQ s85 1) (NEQ s87 1) (NEQ s109 1)) (OR (NEQ s85 1) (NEQ s88 1) (NEQ s123 1)) (OR (NEQ s85 1) (NEQ s93 1) (NEQ s112 1)) (OR (NEQ s85 1) (NEQ s99 1) (NEQ s121 1)) (OR (NEQ s85 1) (NEQ s93 1) (NEQ s114 1)) (OR (NEQ s85 1) (NEQ s99 1) (NEQ s123 1)) (OR (NEQ s85 1) (NEQ s97 1) (NEQ s121 1)) (OR (NEQ s85 1) (NEQ s97 1) (NEQ s123 1)) (OR (NEQ s85 1) (NEQ s94 1) (NEQ s114 1)) (OR (NEQ s85 1) (NEQ s99 1) (NEQ s113 1)) (OR (NEQ s85 1) (NEQ s94 1) (NEQ s112 1)) (OR (NEQ s85 1) (NEQ s94 1) (NEQ s110 1)) (OR (NEQ s85 1) (NEQ s99 1) (NEQ s109 1)) (OR (NEQ s85 1) (NEQ s94 1) (NEQ s124 1)) (OR (NEQ s85 1) (NEQ s99 1) (NEQ s111 1)) (OR (NEQ s85 1) (NEQ s94 1) (NEQ s122 1)) (OR (NEQ s85 1) (NEQ s98 1) (NEQ s123 1)) (OR (NEQ s85 1) (NEQ s98 1) (NEQ s121 1)) (OR (NEQ s85 1) (NEQ s100 1) (NEQ s114 1)) (OR (NEQ s85 1) (NEQ s95 1) (NEQ s113 1)) (OR (NEQ s85 1) (NEQ s100 1) (NEQ s112 1)) (OR (NEQ s85 1) (NEQ s95 1) (NEQ s109 1)) (OR (NEQ s85 1) (NEQ s95 1) (NEQ s111 1)) (OR (NEQ s85 1) (NEQ s95 1) (NEQ s121 1)) (OR (NEQ s85 1) (NEQ s95 1) (NEQ s123 1)) (OR (NEQ s85 1) (NEQ s100 1) (NEQ s110 1)) (OR (NEQ s85 1) (NEQ s96 1) (NEQ s109 1)) (OR (NEQ s85 1) (NEQ s87 1) (NEQ s123 1)) (OR (NEQ s85 1) (NEQ s96 1) (NEQ s113 1)) (OR (NEQ s85 1) (NEQ s87 1) (NEQ s121 1)) (OR (NEQ s85 1) (NEQ s96 1) (NEQ s111 1)) (OR (NEQ s85 1) (NEQ s100 1) (NEQ s122 1)) (OR (NEQ s85 1) (NEQ s88 1) (NEQ s109 1)) (OR (NEQ s85 1) (NEQ s96 1) (NEQ s121 1)) (OR (NEQ s85 1) (NEQ s88 1) (NEQ s111 1)) (OR (NEQ s85 1) (NEQ s100 1) (NEQ s124 1)) (OR (NEQ s85 1) (NEQ s88 1) (NEQ s113 1)) (OR (NEQ s85 1) (NEQ s93 1) (NEQ s121 1)) (OR (NEQ s85 1) (NEQ s88 1) (NEQ s122 1)) (OR (NEQ s85 1) (NEQ s93 1) (NEQ s123 1)) (OR (NEQ s85 1) (NEQ s97 1) (NEQ s112 1)) (OR (NEQ s85 1) (NEQ s98 1) (NEQ s114 1)) (OR (NEQ s85 1) (NEQ s97 1) (NEQ s114 1)) (OR (NEQ s85 1) (NEQ s87 1) (NEQ s110 1)) (OR (NEQ s85 1) (NEQ s99 1) (NEQ s124 1)) (OR (NEQ s85 1) (NEQ s98 1) (NEQ s112 1)) (OR (NEQ s85 1) (NEQ s93 1) (NEQ s111 1)) (OR (NEQ s85 1) (NEQ s88 1) (NEQ s124 1)) (OR (NEQ s85 1) (NEQ s98 1) (NEQ s110 1)) (OR (NEQ s85 1) (NEQ s93 1) (NEQ s113 1)) (OR (NEQ s85 1) (NEQ s87 1) (NEQ s114 1)) (OR (NEQ s85 1) (NEQ s87 1) (NEQ s112 1)) (OR (NEQ s85 1) (NEQ s99 1) (NEQ s122 1)) (OR (NEQ s85 1) (NEQ s97 1) (NEQ s122 1)) (OR (NEQ s85 1) (NEQ s97 1) (NEQ s124 1)) (OR (NEQ s85 1) (NEQ s94 1) (NEQ s113 1)) (OR (NEQ s85 1) (NEQ s94 1) (NEQ s111 1)) (OR (NEQ s85 1) (NEQ s99 1) (NEQ s114 1)) (OR (NEQ s85 1) (NEQ s94 1) (NEQ s109 1)) (OR (NEQ s85 1) (NEQ s94 1) (NEQ s123 1)) (OR (NEQ s85 1) (NEQ s99 1) (NEQ s110 1)) (OR (NEQ s85 1) (NEQ s98 1) (NEQ s124 1)) (OR (NEQ s85 1) (NEQ s98 1) (NEQ s122 1)) (OR (NEQ s85 1) (NEQ s95 1) (NEQ s112 1)) (OR (NEQ s85 1) (NEQ s100 1) (NEQ s113 1)) (OR (NEQ s85 1) (NEQ s95 1) (NEQ s114 1)) (OR (NEQ s85 1) (NEQ s96 1) (NEQ s124 1)) (OR (NEQ s85 1) (NEQ s95 1) (NEQ s110 1)) (OR (NEQ s85 1) (NEQ s95 1) (NEQ s122 1)) (OR (NEQ s85 1) (NEQ s100 1) (NEQ s109 1)) (OR (NEQ s85 1) (NEQ s96 1) (NEQ s110 1)) (OR (NEQ s85 1) (NEQ s87 1) (NEQ s122 1)) (OR (NEQ s85 1) (NEQ s96 1) (NEQ s114 1)) (OR (NEQ s85 1) (NEQ s96 1) (NEQ s112 1)) (OR (NEQ s85 1) (NEQ s93 1) (NEQ s109 1)) (OR (NEQ s85 1) (NEQ s100 1) (NEQ s121 1)) (OR (NEQ s85 1) (NEQ s88 1) (NEQ s110 1)) (OR (NEQ s85 1) (NEQ s87 1) (NEQ s124 1)) (OR (NEQ s85 1) (NEQ s88 1) (NEQ s112 1)) (OR (NEQ s85 1) (NEQ s96 1) (NEQ s122 1)) (OR (NEQ s85 1) (NEQ s100 1) (NEQ s123 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 1005 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 15 in 0 ms.
FORMULA SharedMemory-PT-000010-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-PT-000010-02 finished in 1284 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 10 out of 131 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 10 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2021-05-15 02:22:23] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-15 02:22:23] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2021-05-15 02:22:23] [INFO ] Computed 21 place invariants in 8 ms
[2021-05-15 02:22:23] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2021-05-15 02:22:23] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2021-05-15 02:22:23] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-15 02:22:23] [INFO ] Dead Transitions using invariants and state equation in 118 ms returned []
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SharedMemory-PT-000010-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s115 1) (EQ s101 1) (EQ s116 1) (EQ s103 1) (EQ s102 1) (EQ s106 1) (EQ s104 1) (EQ s107 1) (EQ s105 1) (EQ s108 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2504 reset in 321 ms.
Product exploration explored 100000 steps with 2502 reset in 383 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2518 reset in 327 ms.
Product exploration explored 100000 steps with 2539 reset in 344 ms.
[2021-05-15 02:22:25] [INFO ] Flatten gal took : 14 ms
[2021-05-15 02:22:25] [INFO ] Flatten gal took : 14 ms
[2021-05-15 02:22:25] [INFO ] Time to serialize gal into /tmp/LTL8621738170286295545.gal : 3 ms
[2021-05-15 02:22:25] [INFO ] Time to serialize properties into /tmp/LTL1188960625910272980.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/LTL8621738170286295545.gal, -t, CGAL, -LTL, /tmp/LTL1188960625910272980.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/LTL8621738170286295545.gal -t CGAL -LTL /tmp/LTL1188960625910272980.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((((((Active_10==1)||(Active_7==1))||(Active_9==1))||(Active_5==1))||(Active_8==1))||(Active_4==1))||(Active_6==1))||(Active_1==1))||(Active_3==1))||(Active_2==1))"))))
Formula 0 simplified : !GF"((((((((((Active_10==1)||(Active_7==1))||(Active_9==1))||(Active_5==1))||(Active_8==1))||(Active_4==1))||(Active_6==1))||(Active_1==1))||(Active_3==1))||(Active_2==1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
308 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.10719,118684,1,0,9,469730,24,1,4108,100797,24
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA SharedMemory-PT-000010-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property SharedMemory-PT-000010-03 finished in 6139 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(F(p0))||(!p1 U ((F(!p0)&&p2)||G(!p1))))))], workingDir=/home/mcc/execution]
Support contains 100 out of 131 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 4 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2021-05-15 02:22:28] [INFO ] Computed 21 place invariants in 2 ms
[2021-05-15 02:22:28] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2021-05-15 02:22:28] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-15 02:22:28] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2021-05-15 02:22:28] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2021-05-15 02:22:28] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-15 02:22:29] [INFO ] Dead Transitions using invariants and state equation in 107 ms returned []
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Running random walk in product with property : SharedMemory-PT-000010-04 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (NEQ s115 1) (NEQ s101 1) (NEQ s116 1) (NEQ s103 1) (NEQ s102 1) (NEQ s106 1) (NEQ s104 1) (NEQ s107 1) (NEQ s105 1) (NEQ s108 1)), p0:(OR (EQ s1 1) (EQ s64 1) (EQ s3 1) (EQ s66 1) (EQ s5 1) (EQ s68 1) (EQ s7 1) (EQ s70 1) (EQ s9 1) (EQ s72 1) (EQ s11 1) (EQ s74 1) (EQ s13 1) (EQ s76 1) (EQ s15 1) (EQ s78 1) (EQ s17 1) (EQ s80 1) (EQ s19 1) (EQ s82 1) (EQ s21 1) (EQ s84 1) (EQ s23 1) (EQ s86 1) (EQ s25 1) (EQ s27 1) (EQ s90 1) (EQ s29 1) (EQ s92 1) (EQ s31 1) (EQ s33 1) (EQ s35 1) (EQ s37 1) (EQ s39 1) (EQ s41 1) (EQ s43 1) (EQ s45 1) (EQ s47 1) (EQ s49 1) (EQ s51 1) (EQ s53 1) (EQ s55 1) (EQ s57 1) (EQ s59 1) (EQ s61 1) (EQ s63 1) (EQ s0 1) (EQ s65 1) (EQ s2 1) (EQ s67 1) (EQ s4 1) (EQ s69 1) (EQ s6 1) (EQ s71 1) (EQ s8 1) (EQ s73 1) (EQ s10 1) (EQ s75 1) (EQ s12 1) (EQ s77 1) (EQ s14 1) (EQ s79 1) (EQ s16 1) (EQ s81 1) (EQ s18 1) (EQ s83 1) (EQ s20 1) (EQ s22 1) (EQ s24 1) (EQ s89 1) (EQ s26 1) (EQ s91 1) (EQ s28 1) (EQ s30 1) (EQ s32 1) (EQ s34 1) (EQ s36 1) (EQ s38 1) (EQ s40 1) (EQ s42 1) (EQ s44 1) (EQ s46 1) (EQ s48 1) (EQ s50 1) (EQ s52 1) (EQ s54 1) (EQ s56 1) (EQ s58 1) (EQ s60 1) (EQ s62 1)), p1:(OR (EQ s115 1) (EQ s101 1) (EQ s116 1) (EQ s103 1) (EQ s102 1) (EQ s106 1) (EQ s104 1) (EQ s107 1) (EQ s105 1) (EQ s108 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 15141 reset in 624 ms.
Stack based approach found an accepted trace after 6 steps with 1 reset with depth 3 and stack size 3 in 0 ms.
FORMULA SharedMemory-PT-000010-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-PT-000010-04 finished in 1001 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(!p0))], workingDir=/home/mcc/execution]
Support contains 90 out of 131 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 5 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2021-05-15 02:22:29] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-15 02:22:29] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2021-05-15 02:22:29] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-15 02:22:29] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2021-05-15 02:22:29] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2021-05-15 02:22:29] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-15 02:22:30] [INFO ] Dead Transitions using invariants and state equation in 100 ms returned []
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 33 ms :[true, p0]
Running random walk in product with property : SharedMemory-PT-000010-05 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s1 1) (EQ s64 1) (EQ s3 1) (EQ s66 1) (EQ s5 1) (EQ s68 1) (EQ s7 1) (EQ s70 1) (EQ s9 1) (EQ s72 1) (EQ s11 1) (EQ s74 1) (EQ s13 1) (EQ s76 1) (EQ s15 1) (EQ s78 1) (EQ s17 1) (EQ s80 1) (EQ s19 1) (EQ s82 1) (EQ s21 1) (EQ s84 1) (EQ s23 1) (EQ s86 1) (EQ s25 1) (EQ s27 1) (EQ s90 1) (EQ s29 1) (EQ s92 1) (EQ s31 1) (EQ s33 1) (EQ s35 1) (EQ s37 1) (EQ s39 1) (EQ s41 1) (EQ s43 1) (EQ s45 1) (EQ s47 1) (EQ s49 1) (EQ s51 1) (EQ s53 1) (EQ s55 1) (EQ s57 1) (EQ s59 1) (EQ s61 1) (EQ s63 1) (EQ s0 1) (EQ s65 1) (EQ s2 1) (EQ s67 1) (EQ s4 1) (EQ s69 1) (EQ s6 1) (EQ s71 1) (EQ s8 1) (EQ s73 1) (EQ s10 1) (EQ s75 1) (EQ s12 1) (EQ s77 1) (EQ s14 1) (EQ s79 1) (EQ s16 1) (EQ s81 1) (EQ s18 1) (EQ s83 1) (EQ s20 1) (EQ s22 1) (EQ s24 1) (EQ s89 1) (EQ s26 1) (EQ s91 1) (EQ s28 1) (EQ s30 1) (EQ s32 1) (EQ s34 1) (EQ s36 1) (EQ s38 1) (EQ s40 1) (EQ s42 1) (EQ s44 1) (EQ s46 1) (EQ s48 1) (EQ s50 1) (EQ s52 1) (EQ s54 1) (EQ s56 1) (EQ s58 1) (EQ s60 1) (EQ s62 1))], 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 3 steps with 0 reset in 0 ms.
FORMULA SharedMemory-PT-000010-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-PT-000010-05 finished in 306 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0) U (X(!p2)||p1))))], workingDir=/home/mcc/execution]
Support contains 41 out of 131 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 4 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2021-05-15 02:22:30] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-15 02:22:30] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2021-05-15 02:22:30] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-15 02:22:30] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 131 cols
[2021-05-15 02:22:30] [INFO ] Computed 21 place invariants in 8 ms
[2021-05-15 02:22:30] [INFO ] Dead Transitions using invariants and state equation in 119 ms returned []
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), p2, (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), true, (NOT p0)]
Running random walk in product with property : SharedMemory-PT-000010-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=p2, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) p0 p2), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 4}, { cond=(AND p0 p2), acceptance={0} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (AND (EQ s96 1) (EQ s127 1)) (AND (EQ s100 1) (EQ s117 1)) (AND (EQ s97 1) (EQ s126 1)) (AND (EQ s99 1) (EQ s118 1)) (AND (EQ s98 1) (EQ s125 1)) (AND (EQ s93 1) (EQ s130 1)) (AND (EQ s94 1) (EQ s129 1)) (AND (EQ s95 1) (EQ s128 1)) (AND (EQ s88 1) (EQ s120 1)) (AND (EQ s87 1) (EQ s119 1))), p0:(OR (EQ s115 1) (EQ s101 1) (EQ s116 1) (EQ s103 1) (EQ s102 1) (EQ s106 1) (EQ s104 1) (EQ s107 1) (EQ s105 1) (EQ s108 1)), p2:(AND (OR (NEQ s85 1) (NEQ s97 1) (NEQ s109 1)) (OR (NEQ s85 1) (NEQ s88 1) (NEQ s121 1)) (OR (NEQ s85 1) (NEQ s97 1) (NEQ s111 1)) (OR (NEQ s85 1) (NEQ s98 1) (NEQ s113 1)) (OR (NEQ s85 1) (NEQ s93 1) (NEQ s124 1)) (OR (NEQ s85 1) (NEQ s97 1) (NEQ s113 1)) (OR (NEQ s85 1) (NEQ s87 1) (NEQ s111 1)) (OR (NEQ s85 1) (NEQ s98 1) (NEQ s111 1)) (OR (NEQ s85 1) (NEQ s93 1) (NEQ s110 1)) (OR (NEQ s85 1) (NEQ s87 1) (NEQ s109 1)) (OR (NEQ s85 1) (NEQ s88 1) (NEQ s123 1)) (OR (NEQ s85 1) (NEQ s93 1) (NEQ s112 1)) (OR (NEQ s85 1) (NEQ s99 1) (NEQ s121 1)) (OR (NEQ s85 1) (NEQ s93 1) (NEQ s114 1)) (OR (NEQ s85 1) (NEQ s99 1) (NEQ s123 1)) (OR (NEQ s85 1) (NEQ s97 1) (NEQ s121 1)) (OR (NEQ s85 1) (NEQ s97 1) (NEQ s123 1)) (OR (NEQ s85 1) (NEQ s94 1) (NEQ s114 1)) (OR (NEQ s85 1) (NEQ s99 1) (NEQ s113 1)) (OR (NEQ s85 1) (NEQ s94 1) (NEQ s112 1)) (OR (NEQ s85 1) (NEQ s94 1) (NEQ s110 1)) (OR (NEQ s85 1) (NEQ s99 1) (NEQ s109 1)) (OR (NEQ s85 1) (NEQ s94 1) (NEQ s124 1)) (OR (NEQ s85 1) (NEQ s99 1) (NEQ s111 1)) (OR (NEQ s85 1) (NEQ s94 1) (NEQ s122 1)) (OR (NEQ s85 1) (NEQ s98 1) (NEQ s123 1)) (OR (NEQ s85 1) (NEQ s98 1) (NEQ s121 1)) (OR (NEQ s85 1) (NEQ s100 1) (NEQ s114 1)) (OR (NEQ s85 1) (NEQ s95 1) (NEQ s113 1)) (OR (NEQ s85 1) (NEQ s100 1) (NEQ s112 1)) (OR (NEQ s85 1) (NEQ s95 1) (NEQ s109 1)) (OR (NEQ s85 1) (NEQ s95 1) (NEQ s111 1)) (OR (NEQ s85 1) (NEQ s95 1) (NEQ s121 1)) (OR (NEQ s85 1) (NEQ s95 1) (NEQ s123 1)) (OR (NEQ s85 1) (NEQ s100 1) (NEQ s110 1)) (OR (NEQ s85 1) (NEQ s96 1) (NEQ s109 1)) (OR (NEQ s85 1) (NEQ s87 1) (NEQ s123 1)) (OR (NEQ s85 1) (NEQ s96 1) (NEQ s113 1)) (OR (NEQ s85 1) (NEQ s87 1) (NEQ s121 1)) (OR (NEQ s85 1) (NEQ s96 1) (NEQ s111 1)) (OR (NEQ s85 1) (NEQ s100 1) (NEQ s122 1)) (OR (NEQ s85 1) (NEQ s88 1) (NEQ s109 1)) (OR (NEQ s85 1) (NEQ s96 1) (NEQ s121 1)) (OR (NEQ s85 1) (NEQ s88 1) (NEQ s111 1)) (OR (NEQ s85 1) (NEQ s100 1) (NEQ s124 1)) (OR (NEQ s85 1) (NEQ s88 1) (NEQ s113 1)) (OR (NEQ s85 1) (NEQ s93 1) (NEQ s121 1)) (OR (NEQ s85 1) (NEQ s88 1) (NEQ s122 1)) (OR (NEQ s85 1) (NEQ s93 1) (NEQ s123 1)) (OR (NEQ s85 1) (NEQ s97 1) (NEQ s112 1)) (OR (NEQ s85 1) (NEQ s98 1) (NEQ s114 1)) (OR (NEQ s85 1) (NEQ s97 1) (NEQ s114 1)) (OR (NEQ s85 1) (NEQ s87 1) (NEQ s110 1)) (OR (NEQ s85 1) (NEQ s99 1) (NEQ s124 1)) (OR (NEQ s85 1) (NEQ s98 1) (NEQ s112 1)) (OR (NEQ s85 1) (NEQ s93 1) (NEQ s111 1)) (OR (NEQ s85 1) (NEQ s88 1) (NEQ s124 1)) (OR (NEQ s85 1) (NEQ s98 1) (NEQ s110 1)) (OR (NEQ s85 1) (NEQ s93 1) (NEQ s113 1)) (OR (NEQ s85 1) (NEQ s87 1) (NEQ s114 1)) (OR (NEQ s85 1) (NEQ s87 1) (NEQ s112 1)) (OR (NEQ s85 1) (NEQ s99 1) (NEQ s122 1)) (OR (NEQ s85 1) (NEQ s97 1) (NEQ s122 1)) (OR (NEQ s85 1) (NEQ s97 1) (NEQ s124 1)) (OR (NEQ s85 1) (NEQ s94 1) (NEQ s113 1)) (OR (NEQ s85 1) (NEQ s94 1) (NEQ s111 1)) (OR (NEQ s85 1) (NEQ s99 1) (NEQ s114 1)) (OR (NEQ s85 1) (NEQ s94 1) (NEQ s109 1)) (OR (NEQ s85 1) (NEQ s94 1) (NEQ s123 1)) (OR (NEQ s85 1) (NEQ s99 1) (NEQ s110 1)) (OR (NEQ s85 1) (NEQ s98 1) (NEQ s124 1)) (OR (NEQ s85 1) (NEQ s98 1) (NEQ s122 1)) (OR (NEQ s85 1) (NEQ s95 1) (NEQ s112 1)) (OR (NEQ s85 1) (NEQ s100 1) (NEQ s113 1)) (OR (NEQ s85 1) (NEQ s95 1) (NEQ s114 1)) (OR (NEQ s85 1) (NEQ s96 1) (NEQ s124 1)) (OR (NEQ s85 1) (NEQ s95 1) (NEQ s110 1)) (OR (NEQ s85 1) (NEQ s95 1) (NEQ s122 1)) (OR (NEQ s85 1) (NEQ s100 1) (NEQ s109 1)) (OR (NEQ s85 1) (NEQ s96 1) (NEQ s110 1)) (OR (NEQ s85 1) (NEQ s87 1) (NEQ s122 1)) (OR (NEQ s85 1) (NEQ s96 1) (NEQ s114 1)) (OR (NEQ s85 1) (NEQ s96 1) (NEQ s112 1)) (OR (NEQ s85 1) (NEQ s93 1) (NEQ s109 1)) (OR (NEQ s85 1) (NEQ s100 1) (NEQ s121 1)) (OR (NEQ s85 1) (NEQ s88 1) (NEQ s110 1)) (OR (NEQ s85 1) (NEQ s87 1) (NEQ s124 1)) (OR (NEQ s85 1) (NEQ s88 1) (NEQ s112 1)) (OR (NEQ s85 1) (NEQ s96 1) (NEQ s122 1)) (OR (NEQ s85 1) (NEQ s100 1) (NEQ s123 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 30 steps with 0 reset in 0 ms.
FORMULA SharedMemory-PT-000010-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-PT-000010-06 finished in 377 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(F(!p1)))))], workingDir=/home/mcc/execution]
Support contains 100 out of 131 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 4 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2021-05-15 02:22:30] [INFO ] Computed 21 place invariants in 0 ms
[2021-05-15 02:22:30] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2021-05-15 02:22:30] [INFO ] Computed 21 place invariants in 2 ms
[2021-05-15 02:22:30] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2021-05-15 02:22:30] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2021-05-15 02:22:30] [INFO ] Computed 21 place invariants in 0 ms
[2021-05-15 02:22:30] [INFO ] Dead Transitions using invariants and state equation in 130 ms returned []
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : SharedMemory-PT-000010-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (NEQ s1 1) (NEQ s64 1) (NEQ s3 1) (NEQ s66 1) (NEQ s5 1) (NEQ s68 1) (NEQ s7 1) (NEQ s70 1) (NEQ s9 1) (NEQ s72 1) (NEQ s11 1) (NEQ s74 1) (NEQ s13 1) (NEQ s76 1) (NEQ s15 1) (NEQ s78 1) (NEQ s17 1) (NEQ s80 1) (NEQ s19 1) (NEQ s82 1) (NEQ s21 1) (NEQ s84 1) (NEQ s23 1) (NEQ s86 1) (NEQ s25 1) (NEQ s27 1) (NEQ s90 1) (NEQ s29 1) (NEQ s92 1) (NEQ s31 1) (NEQ s33 1) (NEQ s35 1) (NEQ s37 1) (NEQ s39 1) (NEQ s41 1) (NEQ s43 1) (NEQ s45 1) (NEQ s47 1) (NEQ s49 1) (NEQ s51 1) (NEQ s53 1) (NEQ s55 1) (NEQ s57 1) (NEQ s59 1) (NEQ s61 1) (NEQ s63 1) (NEQ s0 1) (NEQ s65 1) (NEQ s2 1) (NEQ s67 1) (NEQ s4 1) (NEQ s69 1) (NEQ s6 1) (NEQ s71 1) (NEQ s8 1) (NEQ s73 1) (NEQ s10 1) (NEQ s75 1) (NEQ s12 1) (NEQ s77 1) (NEQ s14 1) (NEQ s79 1) (NEQ s16 1) (NEQ s81 1) (NEQ s18 1) (NEQ s83 1) (NEQ s20 1) (NEQ s22 1) (NEQ s24 1) (NEQ s89 1) (NEQ s26 1) (NEQ s91 1) (NEQ s28 1) (NEQ s30 1) (NEQ s32 1) (NEQ s34 1) (NEQ s36 1) (NEQ s38 1) (NEQ s40 1) (NEQ s42 1) (NEQ s44 1) (NEQ s46 1) (NEQ s48 1) (NEQ s50 1) (NEQ s52 1) (NEQ s54 1) (NEQ s56 1) (NEQ s58 1) (NEQ s60 1) (NEQ s62 1)) (AND (NEQ s115 1) (NEQ s101 1) (NEQ s116 1) (NEQ s103 1) (NEQ s102 1) (NEQ s106 1) (NEQ s104 1) (NEQ s107 1) (NEQ s105 1) (NEQ s108 1))), p1:(OR (EQ s1 1) (EQ s64 1) (EQ s3 1) (EQ s66 1) (EQ s5 1) (EQ s68 1) (EQ s7 1) (EQ s70 1) (EQ s9 1) (EQ s72 1) (EQ s11 1) (EQ s74 1) (EQ s13 1) (EQ s76 1) (EQ s15 1) (EQ s78 1) (EQ s17 1) (EQ s80 1) (EQ s19 1) (EQ s82 1) (EQ s21 1) (EQ s84 1) (EQ s23 1) (EQ s86 1) (EQ s25 1) (EQ s27 1) (EQ s90 1) (EQ s29 1) (EQ s92 1) (EQ s31 1) (EQ s33 1) (EQ s35 1) (EQ s37 1) (EQ s39 1) (EQ s41 1) (EQ s43 1) (EQ s45 1) (EQ s47 1) (EQ s49 1) (EQ s51 1) (EQ s53 1) (EQ s55 1) (EQ s57 1) (EQ s59 1) (EQ s61 1) (EQ s63 1) (EQ s0 1) (EQ s65 1) (EQ s2 1) (EQ s67 1) (EQ s4 1) (EQ s69 1) (EQ s6 1) (EQ s71 1) (EQ s8 1) (EQ s73 1) (EQ s10 1) (EQ s75 1) (EQ s12 1) (EQ s77 1) (EQ s14 1) (EQ s79 1) (EQ s16 1) (EQ s81 1) (EQ s18 1) (EQ s83 1) (EQ s20 1) (EQ s22 1) (EQ s24 1) (EQ s89 1) (EQ s26 1) (EQ s91 1) (EQ s28 1) (EQ s30 1) (EQ s32 1) (EQ s34 1) (EQ s36 1) (EQ s38 1) (EQ s40 1) (EQ s42 1) (EQ s44 1) (EQ s46 1) (EQ s48 1) (EQ s50 1) (EQ s52 1) (EQ s54 1) (EQ s56 1) (EQ s58 1) (EQ s60 1) (EQ s62 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6548 reset in 655 ms.
Stack based approach found an accepted trace after 37 steps with 2 reset with depth 15 and stack size 14 in 1 ms.
FORMULA SharedMemory-PT-000010-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-PT-000010-07 finished in 1012 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((G(p0)||G((p1&&X(p2)))||(X(p2)&&p3)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 131 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 3 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2021-05-15 02:22:31] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-15 02:22:31] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2021-05-15 02:22:31] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-15 02:22:31] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 131 cols
[2021-05-15 02:22:31] [INFO ] Computed 21 place invariants in 6 ms
[2021-05-15 02:22:31] [INFO ] Dead Transitions using invariants and state equation in 113 ms returned []
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 97 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : SharedMemory-PT-000010-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p3) (NOT p1)) (AND (NOT p3) (NOT p2))), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p0) p3) (AND p3 (NOT p1)) (AND p3 (NOT p2))), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p3) p1 p2), acceptance={0} source=1 dest: 1}, { cond=(OR (AND p0 (NOT p3) (NOT p1)) (AND p0 (NOT p3) (NOT p2))), acceptance={1} source=1 dest: 1}, { cond=(AND p0 (NOT p3) p1 p2), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) p3 (NOT p1)) (AND (NOT p0) p3 (NOT p2))), acceptance={0, 1} source=1 dest: 2}, { cond=(AND (NOT p0) p3 p1 p2), acceptance={0} source=1 dest: 2}, { cond=(OR (AND p0 p3 (NOT p1)) (AND p0 p3 (NOT p2))), acceptance={1} source=1 dest: 2}, { cond=(AND p0 p3 p1 p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p0) p3 (NOT p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 p3 (NOT p2)), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s85 1) (EQ s94 1) (EQ s109 1)), p3:(AND (NEQ s101 1) (NEQ s101 0)), p1:(NEQ s101 1), p2:(NEQ s116 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 577 ms.
Stack based approach found an accepted trace after 39 steps with 0 reset with depth 40 and stack size 36 in 0 ms.
FORMULA SharedMemory-PT-000010-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-PT-000010-08 finished in 921 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 4 out of 131 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 6 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2021-05-15 02:22:32] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-15 02:22:32] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2021-05-15 02:22:32] [INFO ] Computed 21 place invariants in 0 ms
[2021-05-15 02:22:32] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2021-05-15 02:22:32] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2021-05-15 02:22:32] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-15 02:22:32] [INFO ] Dead Transitions using invariants and state equation in 93 ms returned []
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 3297 ms :[true, (NOT p0)]
Running random walk in product with property : SharedMemory-PT-000010-09 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:(OR (EQ s85 0) (EQ s87 0) (EQ s122 0) (EQ s108 1))], 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 39 steps with 0 reset in 0 ms.
FORMULA SharedMemory-PT-000010-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-PT-000010-09 finished in 3548 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 131 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 131/131 places, 210/210 transitions.
Drop transitions removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 131 transition count 129
Reduce places removed 82 places and 0 transitions.
Iterating post reduction 1 with 82 rules applied. Total rules applied 163 place count 49 transition count 129
Drop transitions removed 72 transitions
Redundant transition composition rules discarded 72 transitions
Iterating global reduction 2 with 72 rules applied. Total rules applied 235 place count 49 transition count 57
Applied a total of 235 rules in 14 ms. Remains 49 /131 variables (removed 82) and now considering 57/210 (removed 153) transitions.
// Phase 1: matrix 57 rows 49 cols
[2021-05-15 02:22:36] [INFO ] Computed 20 place invariants in 0 ms
[2021-05-15 02:22:36] [INFO ] Implicit Places using invariants in 252 ms returned []
// Phase 1: matrix 57 rows 49 cols
[2021-05-15 02:22:36] [INFO ] Computed 20 place invariants in 0 ms
[2021-05-15 02:22:36] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
[2021-05-15 02:22:36] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 57 rows 49 cols
[2021-05-15 02:22:36] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-15 02:22:36] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 1 iterations. Remains : 49/131 places, 57/210 transitions.
Stuttering acceptance computed with spot in 1010 ms :[true, (NOT p0)]
Running random walk in product with property : SharedMemory-PT-000010-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}]], initial=1, aps=[p0:(EQ s22 1)], 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 2 steps with 0 reset in 0 ms.
FORMULA SharedMemory-PT-000010-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-PT-000010-10 finished in 1410 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U (p1&&F(p2)&&X(F(p3))))))], workingDir=/home/mcc/execution]
Support contains 7 out of 131 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 2 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2021-05-15 02:22:37] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-15 02:22:37] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2021-05-15 02:22:37] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-15 02:22:37] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 131 cols
[2021-05-15 02:22:37] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-15 02:22:37] [INFO ] Dead Transitions using invariants and state equation in 109 ms returned []
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p2) (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p2) (NOT p3)), true, (NOT p2), (NOT p3)]
Running random walk in product with property : SharedMemory-PT-000010-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s108 1), p0:(AND (EQ s99 1) (EQ s118 1)), p2:(NEQ s103 1), p3:(OR (NEQ s85 1) (NEQ s97 1) (NEQ s112 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 32 steps with 2 reset in 0 ms.
FORMULA SharedMemory-PT-000010-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-PT-000010-11 finished in 433 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X((F(p2)&&p1))&&p0)))], workingDir=/home/mcc/execution]
Support contains 5 out of 131 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 2 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2021-05-15 02:22:37] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-15 02:22:37] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2021-05-15 02:22:37] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-15 02:22:37] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 131 cols
[2021-05-15 02:22:37] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-15 02:22:38] [INFO ] Dead Transitions using invariants and state equation in 103 ms returned []
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p1) (NOT p0)), true]
Running random walk in product with property : SharedMemory-PT-000010-12 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p2:(OR (NEQ s93 1) (NEQ s130 1)), p1:(AND (EQ s102 0) (OR (EQ s85 0) (EQ s93 0) (EQ s124 0))), p0:(AND (EQ s93 1) (EQ s130 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SharedMemory-PT-000010-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-PT-000010-12 finished in 364 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((F(!p0)&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 131 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 131/131 places, 210/210 transitions.
Drop transitions removed 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 73 rules applied. Total rules applied 73 place count 131 transition count 137
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 1 with 74 rules applied. Total rules applied 147 place count 57 transition count 137
Drop transitions removed 64 transitions
Redundant transition composition rules discarded 64 transitions
Iterating global reduction 2 with 64 rules applied. Total rules applied 211 place count 57 transition count 73
Applied a total of 211 rules in 9 ms. Remains 57 /131 variables (removed 74) and now considering 73/210 (removed 137) transitions.
// Phase 1: matrix 73 rows 57 cols
[2021-05-15 02:22:38] [INFO ] Computed 20 place invariants in 0 ms
[2021-05-15 02:22:38] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 73 rows 57 cols
[2021-05-15 02:22:38] [INFO ] Computed 20 place invariants in 0 ms
[2021-05-15 02:22:38] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2021-05-15 02:22:38] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 73 rows 57 cols
[2021-05-15 02:22:38] [INFO ] Computed 20 place invariants in 0 ms
[2021-05-15 02:22:38] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Finished structural reductions, in 1 iterations. Remains : 57/131 places, 73/210 transitions.
Stuttering acceptance computed with spot in 75 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : SharedMemory-PT-000010-14 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s21 1) (EQ s55 1)), p0:(NEQ s27 1)], nbAcceptance=1, 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 788 reset in 222 ms.
Stack based approach found an accepted trace after 33 steps with 0 reset with depth 34 and stack size 33 in 0 ms.
FORMULA SharedMemory-PT-000010-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-PT-000010-14 finished in 424 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(F(p0))||(p1&&(p2||X(X(G(p3))))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 131 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 2 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2021-05-15 02:22:38] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-15 02:22:38] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2021-05-15 02:22:38] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-15 02:22:38] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 131 cols
[2021-05-15 02:22:38] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-15 02:22:38] [INFO ] Dead Transitions using invariants and state equation in 93 ms returned []
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : SharedMemory-PT-000010-15 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p3), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(NEQ s12 1), p1:(EQ s106 0), p2:(EQ s68 0), p3:(AND (NEQ s98 0) (NEQ s125 0))], 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 34309 reset in 228 ms.
Stack based approach found an accepted trace after 259 steps with 88 reset with depth 4 and stack size 4 in 1 ms.
FORMULA SharedMemory-PT-000010-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-PT-000010-15 finished in 594 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621045360215

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is SharedMemory-PT-000010, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r216-tall-162098204600125"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SharedMemory-PT-000010.tgz
mv SharedMemory-PT-000010 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;