About the Execution of ITS-Tools for SharedMemory-PT-000100
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15595.216 | 2143617.00 | 5407297.00 | 705.40 | FFTTFTTFFFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2022-input.r204-oct2-165281599600692.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is SharedMemory-PT-000100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r204-oct2-165281599600692
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 60M
-rw-r--r-- 1 mcc users 1.5M Apr 30 16:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 5.3M Apr 30 16:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3M Apr 30 15:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 24M Apr 30 15:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 1.1M May 9 08:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 2.8M May 9 08:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1M May 9 08:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 6.1M May 9 08:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 198K May 9 08:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 409K May 9 08:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 11M May 10 09:34 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-000100-LTLFireability-00
FORMULA_NAME SharedMemory-PT-000100-LTLFireability-01
FORMULA_NAME SharedMemory-PT-000100-LTLFireability-02
FORMULA_NAME SharedMemory-PT-000100-LTLFireability-03
FORMULA_NAME SharedMemory-PT-000100-LTLFireability-04
FORMULA_NAME SharedMemory-PT-000100-LTLFireability-05
FORMULA_NAME SharedMemory-PT-000100-LTLFireability-06
FORMULA_NAME SharedMemory-PT-000100-LTLFireability-07
FORMULA_NAME SharedMemory-PT-000100-LTLFireability-08
FORMULA_NAME SharedMemory-PT-000100-LTLFireability-09
FORMULA_NAME SharedMemory-PT-000100-LTLFireability-10
FORMULA_NAME SharedMemory-PT-000100-LTLFireability-11
FORMULA_NAME SharedMemory-PT-000100-LTLFireability-12
FORMULA_NAME SharedMemory-PT-000100-LTLFireability-13
FORMULA_NAME SharedMemory-PT-000100-LTLFireability-14
FORMULA_NAME SharedMemory-PT-000100-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652982438407
Running Version 202205111006
[2022-05-19 17:47:19] [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]
[2022-05-19 17:47:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 17:47:20] [INFO ] Load time of PNML (sax parser for PT used): 610 ms
[2022-05-19 17:47:20] [INFO ] Transformed 10301 places.
[2022-05-19 17:47:20] [INFO ] Transformed 20100 transitions.
[2022-05-19 17:47:20] [INFO ] Found NUPN structural information;
[2022-05-19 17:47:20] [INFO ] Completing missing partition info from NUPN : creating a component with [Ext_Mem_Acc_57_1, Ext_Mem_Acc_56_1, Ext_Mem_Acc_19_2, Ext_Mem_Acc_18_2, Ext_Mem_Acc_72_2, Ext_Mem_Acc_63_2, Ext_Mem_Acc_11_3, Ext_Mem_Acc_12_3, Ext_Mem_Acc_64_3, Ext_Mem_Acc_61_3, Ext_Mem_Acc_49_4, Ext_Mem_Acc_48_4, Ext_Mem_Acc_12_5, Ext_Mem_Acc_17_5, Ext_Mem_Acc_22_5, Ext_Mem_Acc_21_5, Ext_Mem_Acc_95_5, Ext_Mem_Acc_98_5, Ext_Mem_Acc_28_6, Ext_Mem_Acc_29_6, Ext_Mem_Acc_41_7, Ext_Mem_Acc_80_6, Ext_Mem_Acc_2_8, Ext_Mem_Acc_99_7, Ext_Mem_Acc_47_8, Ext_Mem_Acc_46_8, Ext_Mem_Acc_23_9, Ext_Mem_Acc_26_9, Ext_Mem_Acc_84_8, Ext_Mem_Acc_85_8, Ext_Mem_Acc_39_9, Ext_Mem_Acc_40_9, Ext_Mem_Acc_28_10, Ext_Mem_Acc_29_10, Ext_Mem_Acc_3_11, Ext_Mem_Acc_2_11, Ext_Mem_Acc_99_11, Ext_Mem_Acc_100_11, Ext_Mem_Acc_42_11, Ext_Mem_Acc_43_11, Ext_Mem_Acc_95_11, Ext_Mem_Acc_94_11, Ext_Mem_Acc_73_13, Ext_Mem_Acc_72_13, Ext_Mem_Acc_91_12, Ext_Mem_Acc_92_12, Ext_Mem_Acc_71_14, Ext_Mem_Acc_68_14, Ext_Mem_Acc_22_14, Ext_Mem_Acc_21_14, Ext_Mem_Acc_25_14, Ext_Mem_Acc_26_14, Ext_Mem_Acc_43_16, Ext_Mem_Acc_44_16, Ext_Mem_Acc_69_15, Ext_Mem_Acc_70_15, Ext_Mem_Acc_71_17, Ext_Mem_Acc_78_17, Ext_Mem_Acc_90_16, Ext_Mem_Acc_91_16, Ext_Mem_Acc_73_16, Ext_Mem_Acc_72_16, Ext_Mem_Acc_59_18, Ext_Mem_Acc_58_18, Ext_Mem_Acc_86_17, Ext_Mem_Acc_85_17, Ext_Mem_Acc_19_20, Ext_Mem_Acc_21_20, Ext_Mem_Acc_64_19, Ext_Mem_Acc_63_19, Ext_Mem_Acc_8_19, Ext_Mem_Acc_9_19, Ext_Mem_Acc_3_21, Ext_Mem_Acc_2_21, Ext_Mem_Acc_54_20, Ext_Mem_Acc_55_20, Ext_Mem_Acc_99_22, Ext_Mem_Acc_98_22, Ext_Mem_Acc_79_23, Ext_Mem_Acc_80_23, Ext_Mem_Acc_86_21, Ext_Mem_Acc_85_21, Ext_Mem_Acc_3_22, Ext_Mem_Acc_4_22, Ext_Mem_Acc_93_22, Ext_Mem_Acc_92_22, Ext_Mem_Acc_75_25, Ext_Mem_Acc_76_25, Ext_Mem_Acc_48_26, Ext_Mem_Acc_49_26, Ext_Mem_Acc_30_24, Ext_Mem_Acc_31_24, Ext_Mem_Acc_85_24, Ext_Mem_Acc_84_24, Ext_Mem_Acc_33_25, Ext_Mem_Acc_34_25, Ext_Mem_Acc_43_28, Ext_Mem_Acc_44_28, Ext_Mem_Acc_25_29, Ext_Mem_Acc_24_29, Ext_Mem_Acc_48_27, Ext_Mem_Acc_47_27, Ext_Mem_Acc_92_26, Ext_Mem_Acc_93_26, Ext_Mem_Acc_49_27, Ext_Mem_Acc_50_27, Ext_Mem_Acc_83_30, Ext_Mem_Acc_82_30, Ext_Mem_Acc_85_31, Ext_Mem_Acc_86_31, Ext_Mem_Acc_83_29, Ext_Mem_Acc_84_29, Ext_Mem_Acc_40_30, Ext_Mem_Acc_41_30, Ext_Mem_Acc_31_30, Ext_Mem_Acc_29_30, Ext_Mem_Acc_58_34, Ext_Mem_Acc_59_34, Ext_Mem_Acc_41_33, Ext_Mem_Acc_44_33, Ext_Mem_Acc_85_32, Ext_Mem_Acc_84_32, Ext_Mem_Acc_28_32, Ext_Mem_Acc_27_32, Ext_Mem_Acc_46_32, Ext_Mem_Acc_47_32, Ext_Mem_Acc_98_36, Ext_Mem_Acc_1_37, Ext_Mem_Acc_20_36, Ext_Mem_Acc_17_36, Ext_Mem_Acc_56_35, Ext_Mem_Acc_55_35, Ext_Mem_Acc_74_34, Ext_Mem_Acc_75_34, Ext_Mem_Acc_9_35, Ext_Mem_Acc_8_35, Ext_Mem_Acc_41_39, Ext_Mem_Acc_42_39, Ext_Mem_Acc_68_38, Ext_Mem_Acc_69_38, Ext_Mem_Acc_29_38, Ext_Mem_Acc_30_38, Ext_Mem_Acc_74_37, Ext_Mem_Acc_73_37, Ext_Mem_Acc_18_37, Ext_Mem_Acc_19_37, Ext_Mem_Acc_89_41, Ext_Mem_Acc_90_41, Ext_Mem_Acc_9_41, Ext_Mem_Acc_8_41, Ext_Mem_Acc_91_40, Ext_Mem_Acc_90_40, Ext_Mem_Acc_9_40, Ext_Mem_Acc_10_40, Ext_Mem_Acc_42_45, Ext_Mem_Acc_43_45, Ext_Mem_Acc_94_44, Ext_Mem_Acc_1_45, Ext_Mem_Acc_76_45, Ext_Mem_Acc_89_45, Ext_Mem_Acc_59_46, Ext_Mem_Acc_60_46, Ext_Mem_Acc_38_47, Ext_Mem_Acc_32_47, Ext_Mem_Acc_68_42, Ext_Mem_Acc_75_42, Ext_Mem_Acc_59_42, Ext_Mem_Acc_60_42, Ext_Mem_Acc_14_43, Ext_Mem_Acc_9_43, Ext_Mem_Acc_17_44, Ext_Mem_Acc_73_43, Ext_Mem_Acc_90_44, Ext_Mem_Acc_89_44, Ext_Mem_Acc_28_50, Ext_Mem_Acc_41_50, Ext_Mem_Acc_58_50, Ext_Mem_Acc_53_50, Ext_Mem_Acc_39_51, Ext_Mem_Acc_9_51, Ext_Mem_Acc_3_52, Ext_Mem_Acc_98_51, Ext_Mem_Acc_18_52, Ext_Mem_Acc_7_52, Ext_Mem_Acc_67_47, Ext_Mem_Acc_62_47, Ext_Mem_Acc_10_48, Ext_Mem_Acc_18_48, Ext_Mem_Acc_66_48, Ext_Mem_Acc_67_48, Ext_Mem_Acc_22_49, Ext_Mem_Acc_23_49, Ext_Mem_Acc_66_49, Ext_Mem_Acc_65_49, Ext_Mem_Acc_43_56, Ext_Mem_Acc_44_56, Ext_Mem_Acc_87_55, Ext_Mem_Acc_88_55, Ext_Mem_Acc_42_55, Ext_Mem_Acc_41_55, Ext_Mem_Acc_53_57, Ext_Mem_Acc_52_57, Ext_Mem_Acc_2_57, Ext_Mem_Acc_3_57, Ext_Mem_Acc_97_53, Ext_Mem_Acc_98_53, Ext_Mem_Acc_17_53, Ext_Mem_Acc_16_53, Ext_Mem_Acc_86_52, Ext_Mem_Acc_87_52, Ext_Mem_Acc_72_54, Ext_Mem_Acc_73_54, Ext_Mem_Acc_99_53, Ext_Mem_Acc_100_53, Ext_Mem_Acc_25_61, Ext_Mem_Acc_24_61, Ext_Mem_Acc_68_60, Ext_Mem_Acc_69_60, Ext_Mem_Acc_79_60, Ext_Mem_Acc_78_60, Ext_Mem_Acc_72_62, Ext_Mem_Acc_73_62, Ext_Mem_Acc_24_62, Ext_Mem_Acc_23_62, Ext_Mem_Acc_68_58, Ext_Mem_Acc_69_58, Ext_Mem_Acc_88_57, Ext_Mem_Acc_87_57, Ext_Mem_Acc_81_59, Ext_Mem_Acc_82_59, Ext_Mem_Acc_36_60, Ext_Mem_Acc_35_60, Ext_Mem_Acc_49_59, Ext_Mem_Acc_63_59, Ext_Mem_Acc_43_67, Ext_Mem_Acc_42_67, Ext_Mem_Acc_91_67, Ext_Mem_Acc_92_67, Ext_Mem_Acc_98_65, Ext_Mem_Acc_97_65, Ext_Mem_Acc_83_65, Ext_Mem_Acc_84_65, Ext_Mem_Acc_40_66, Ext_Mem_Acc_39_66, Ext_Mem_Acc_70_64, Ext_Mem_Acc_71_64, Ext_Mem_Acc_42_65, Ext_Mem_Acc_43_65, Ext_Mem_Acc_56_63, Ext_Mem_Acc_57_63, Ext_Mem_Acc_15_63, Ext_Mem_Acc_14_63, Ext_Mem_Acc_95_63, Ext_Mem_Acc_96_63, Ext_Mem_Acc_55_72, Ext_Mem_Acc_56_72, Ext_Mem_Acc_3_73, Ext_Mem_Acc_2_73, Ext_Mem_Acc_93_70, Ext_Mem_Acc_92_70, Ext_Mem_Acc_38_71, Ext_Mem_Acc_39_71, Ext_Mem_Acc_94_71, Ext_Mem_Acc_95_71, Ext_Mem_Acc_9_70, Ext_Mem_Acc_8_70, Ext_Mem_Acc_16_70, Ext_Mem_Acc_17_70, Ext_Mem_Acc_45_68, Ext_Mem_Acc_46_68, Ext_Mem_Acc_61_68, Ext_Mem_Acc_2_69, Ext_Mem_Acc_18_69, Ext_Mem_Acc_25_69, Ext_Mem_Acc_92_77, Ext_Mem_Acc_5_78, Ext_Mem_Acc_85_77, Ext_Mem_Acc_88_77, Ext_Mem_Acc_96_76, Ext_Mem_Acc_22_77, Ext_Mem_Acc_39_76, Ext_Mem_Acc_42_76, Ext_Mem_Acc_26_76, Ext_Mem_Acc_15_76, Ext_Mem_Acc_62_75, Ext_Mem_Acc_57_75, Ext_Mem_Acc_13_75, Ext_Mem_Acc_85_74, Ext_Mem_Acc_48_74, Ext_Mem_Acc_47_74, Ext_Mem_Acc_99_73, Ext_Mem_Acc_100_73, Ext_Mem_Acc_38_73, Ext_Mem_Acc_41_73, Ext_Mem_Acc_52_83, Ext_Mem_Acc_53_83, Ext_Mem_Acc_67_82, Ext_Mem_Acc_79_82, Ext_Mem_Acc_4_82, Ext_Mem_Acc_9_82, Ext_Mem_Acc_22_81, Ext_Mem_Acc_21_81, Ext_Mem_Acc_69_81, Ext_Mem_Acc_62_81, Ext_Mem_Acc_10_81, Ext_Mem_Acc_84_80, Ext_Mem_Acc_37_80, Ext_Mem_Acc_36_80, Ext_Mem_Acc_35_79, Ext_Mem_Acc_34_79, Ext_Mem_Acc_76_78, Ext_Mem_Acc_77_78, Ext_Mem_Acc_90_78, Ext_Mem_Acc_89_78, Ext_Mem_Acc_72_89, Ext_Mem_Acc_71_89, Ext_Mem_Acc_93_88, Ext_Mem_Acc_90_88, Ext_Mem_Acc_33_91, Ext_Mem_Acc_34_91, Ext_Mem_Acc_51_90, Ext_Mem_Acc_54_90, Ext_Mem_Acc_63_92, Ext_Mem_Acc_62_92, Ext_Mem_Acc_18_92, Ext_Mem_Acc_19_92, Ext_Mem_Acc_76_91, Ext_Mem_Acc_79_91, Ext_Mem_Acc_80_93, Ext_Mem_Acc_79_93, Ext_Mem_Acc_24_93, Ext_Mem_Acc_23_93, Ext_Mem_Acc_40_84, Ext_Mem_Acc_37_84, Ext_Mem_Acc_98_84, Ext_Mem_Acc_1_85, Ext_Mem_Acc_18_84, Ext_Mem_Acc_19_84, Ext_Mem_Acc_12_86, Ext_Mem_Acc_11_86, Ext_Mem_Acc_32_85, Ext_Mem_Acc_33_85, Ext_Mem_Acc_25_87, Ext_Mem_Acc_24_87, Ext_Mem_Acc_38_87, Ext_Mem_Acc_39_87, Ext_Mem_Acc_92_86, Ext_Mem_Acc_65_86, Ext_Mem_Acc_85_88, Ext_Mem_Acc_86_88, Ext_Mem_Acc_72_87, Ext_Mem_Acc_75_87, Ext_Mem_Acc_61_99, Ext_Mem_Acc_62_99, Ext_Mem_Acc_42_99, Ext_Mem_Acc_41_99, Ext_Mem_Acc_93_99, Ext_Mem_Acc_16_100, Ext_Mem_Acc_76_100, Ext_Mem_Acc_73_100, Ext_Mem_Acc_51_94, Ext_Mem_Acc_52_94, Ext_Mem_Acc_95_94, Ext_Mem_Acc_93_94, Ext_Mem_Acc_51_95, Ext_Mem_Acc_50_95, Ext_Mem_Acc_100_95, Ext_Mem_Acc_8_96, Ext_Mem_Acc_56_96, Ext_Mem_Acc_49_96, Ext_Mem_Acc_26_97, Ext_Mem_Acc_17_97, Ext_Mem_Acc_37_97, Ext_Mem_Acc_30_97, Ext_Mem_Acc_26_98, Ext_Mem_Acc_95_97, Ext_Mem_Acc_82_98, Ext_Mem_Acc_75_98, Ext_Mem_Acc_91_98, Ext_Mem_Acc_7_99]
[2022-05-19 17:47:20] [INFO ] Parsed PT model containing 10301 places and 20100 transitions in 962 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 207 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA SharedMemory-PT-000100-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000100-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000100-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 10301 out of 10301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10301/10301 places, 20100/20100 transitions.
Applied a total of 0 rules in 81 ms. Remains 10301 /10301 variables (removed 0) and now considering 20100/20100 (removed 0) transitions.
// Phase 1: matrix 20100 rows 10301 cols
[2022-05-19 17:47:26] [INFO ] Computed 201 place invariants in 2407 ms
[2022-05-19 17:47:28] [INFO ] Implicit Places using invariants in 4495 ms returned []
Implicit Place search using SMT only with invariants took 4574 ms to find 0 implicit places.
// Phase 1: matrix 20100 rows 10301 cols
[2022-05-19 17:47:30] [INFO ] Computed 201 place invariants in 2094 ms
[2022-05-19 17:47:32] [INFO ] Dead Transitions using invariants and state equation in 4644 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10301/10301 places, 20100/20100 transitions.
Support contains 10301 out of 10301 places after structural reductions.
[2022-05-19 17:47:35] [INFO ] Flatten gal took : 1290 ms
[2022-05-19 17:47:39] [INFO ] Flatten gal took : 1353 ms
[2022-05-19 17:47:45] [INFO ] Input system was already deterministic with 20100 transitions.
Interrupted random walk after 8178 steps, including 2 resets, run timeout after 30017 ms. (steps per millisecond=0 ) properties seen 22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 20100 rows 10301 cols
[2022-05-19 17:48:18] [INFO ] Computed 201 place invariants in 2320 ms
[2022-05-19 17:48:22] [INFO ] [Real]Absence check using 201 positive place invariants in 858 ms returned sat
[2022-05-19 17:48:43] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 17:48:43] [INFO ] After 25056ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 10301 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10301/10301 places, 20100/20100 transitions.
Drop transitions removed 9899 transitions
Trivial Post-agglo rules discarded 9899 transitions
Performed 9899 trivial Post agglomeration. Transition count delta: 9899
Iterating post reduction 0 with 9899 rules applied. Total rules applied 9899 place count 10301 transition count 10201
Discarding 297 places :
Also discarding 296 output transitions
Drop transitions removed 296 transitions
Remove reverse transitions (loop back) rule discarded transition t18460 and 297 places that fell out of Prefix Of Interest.
Drop transitions removed 9802 transitions
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 9899 transitions.
Graph (trivial) has 3 edges and 6 vertex of which 2 / 6 are part of one of the 1 SCC in 18 ms
Free SCC test removed 1 places
Iterating post reduction 1 with 9901 rules applied. Total rules applied 19800 place count 5 transition count 6
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 19802 place count 5 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 19802 place count 5 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 19805 place count 3 transition count 3
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 19806 place count 3 transition count 2
Ensure Unique test removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 19807 place count 2 transition count 2
Applied a total of 19807 rules in 421 ms. Remains 2 /10301 variables (removed 10299) and now considering 2/20100 (removed 20098) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/10301 places, 2/20100 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 301 out of 10301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10301/10301 places, 20100/20100 transitions.
Applied a total of 0 rules in 2576 ms. Remains 10301 /10301 variables (removed 0) and now considering 20100/20100 (removed 0) transitions.
// Phase 1: matrix 20100 rows 10301 cols
[2022-05-19 17:48:50] [INFO ] Computed 201 place invariants in 2377 ms
[2022-05-19 17:48:51] [INFO ] Implicit Places using invariants in 3849 ms returned []
Implicit Place search using SMT only with invariants took 3851 ms to find 0 implicit places.
// Phase 1: matrix 20100 rows 10301 cols
[2022-05-19 17:48:53] [INFO ] Computed 201 place invariants in 1954 ms
[2022-05-19 17:48:55] [INFO ] Dead Transitions using invariants and state equation in 3434 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10301/10301 places, 20100/20100 transitions.
Stuttering acceptance computed with spot in 602 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SharedMemory-PT-000100-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (AND (EQ s9425 1) (EQ s10285 1)) (AND (EQ s9365 1) (EQ s9688 1)) (AND (EQ s9422 1) (EQ s10251 1)) (AND (EQ s9430 1) (EQ s10290 1)) (AND (EQ s9...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration timeout after 27710 steps with 810 reset in 10001 ms.
Stack based approach found an accepted trace after 252 steps with 27 reset with depth 97 and stack size 97 in 114 ms.
FORMULA SharedMemory-PT-000100-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-PT-000100-LTLFireability-00 finished in 20910 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(p0))))'
Support contains 10000 out of 10301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10301/10301 places, 20100/20100 transitions.
Applied a total of 0 rules in 75 ms. Remains 10301 /10301 variables (removed 0) and now considering 20100/20100 (removed 0) transitions.
// Phase 1: matrix 20100 rows 10301 cols
[2022-05-19 17:49:08] [INFO ] Computed 201 place invariants in 2028 ms
[2022-05-19 17:49:09] [INFO ] Implicit Places using invariants in 3560 ms returned []
Implicit Place search using SMT only with invariants took 3561 ms to find 0 implicit places.
// Phase 1: matrix 20100 rows 10301 cols
[2022-05-19 17:49:11] [INFO ] Computed 201 place invariants in 1873 ms
[2022-05-19 17:49:14] [INFO ] Dead Transitions using invariants and state equation in 4516 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10301/10301 places, 20100/20100 transitions.
Stuttering acceptance computed with spot in 177 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SharedMemory-PT-000100-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (AND (EQ s9483 0) (EQ s9548 0) (EQ s9487 0) (EQ s9544 0) (EQ s9475 0) (EQ s9479 0) (EQ s9499 0) (EQ s9564 0) (EQ s9503 0) (EQ s9560 0) (EQ s9491 0)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA SharedMemory-PT-000100-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-PT-000100-LTLFireability-01 finished in 8460 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 100 out of 10301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10301/10301 places, 20100/20100 transitions.
Applied a total of 0 rules in 53 ms. Remains 10301 /10301 variables (removed 0) and now considering 20100/20100 (removed 0) transitions.
// Phase 1: matrix 20100 rows 10301 cols
[2022-05-19 17:49:17] [INFO ] Computed 201 place invariants in 2630 ms
[2022-05-19 17:49:20] [INFO ] Implicit Places using invariants in 5553 ms returned []
Implicit Place search using SMT only with invariants took 5560 ms to find 0 implicit places.
// Phase 1: matrix 20100 rows 10301 cols
[2022-05-19 17:49:22] [INFO ] Computed 201 place invariants in 2037 ms
[2022-05-19 17:49:24] [INFO ] Dead Transitions using invariants and state equation in 4580 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10301/10301 places, 20100/20100 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SharedMemory-PT-000100-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s9483 1) (EQ s9548 1) (EQ s9487 1) (EQ s9544 1) (EQ s9475 1) (EQ s9479 1) (EQ s9499 1) (EQ s9564 1) (EQ s9503 1) (EQ s9560 1) (EQ s9491 1) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 7257 ms.
Product exploration explored 100000 steps with 50000 reset in 6927 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA SharedMemory-PT-000100-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SharedMemory-PT-000100-LTLFireability-02 finished in 25078 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 201 out of 10301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10301/10301 places, 20100/20100 transitions.
Applied a total of 0 rules in 335 ms. Remains 10301 /10301 variables (removed 0) and now considering 20100/20100 (removed 0) transitions.
// Phase 1: matrix 20100 rows 10301 cols
[2022-05-19 17:49:42] [INFO ] Computed 201 place invariants in 1988 ms
[2022-05-19 17:49:43] [INFO ] Implicit Places using invariants in 3330 ms returned []
Implicit Place search using SMT only with invariants took 3332 ms to find 0 implicit places.
// Phase 1: matrix 20100 rows 10301 cols
[2022-05-19 17:49:45] [INFO ] Computed 201 place invariants in 1770 ms
[2022-05-19 17:49:46] [INFO ] Dead Transitions using invariants and state equation in 3128 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10301/10301 places, 20100/20100 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Running random walk in product with property : SharedMemory-PT-000100-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (EQ s9351 1) (EQ s9460 1) (EQ s9636 1)) (AND (EQ s9351 1) (EQ s9461 1) (EQ s9715 1)) (AND (EQ s9351 1) (EQ s9412 1) (EQ s9646 1)) (AND (EQ s93...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration timeout after 2330 steps with 0 reset in 10017 ms.
Stack based approach found an accepted trace after 120 steps with 0 reset with depth 121 and stack size 121 in 83 ms.
FORMULA SharedMemory-PT-000100-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-PT-000100-LTLFireability-04 finished in 17121 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(F((F(p0)||p1))))))'
Support contains 10101 out of 10301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10301/10301 places, 20100/20100 transitions.
Applied a total of 0 rules in 169 ms. Remains 10301 /10301 variables (removed 0) and now considering 20100/20100 (removed 0) transitions.
// Phase 1: matrix 20100 rows 10301 cols
[2022-05-19 17:49:58] [INFO ] Computed 201 place invariants in 1876 ms
[2022-05-19 17:50:00] [INFO ] Implicit Places using invariants in 3221 ms returned []
Implicit Place search using SMT only with invariants took 3222 ms to find 0 implicit places.
// Phase 1: matrix 20100 rows 10301 cols
[2022-05-19 17:50:02] [INFO ] Computed 201 place invariants in 1881 ms
[2022-05-19 17:50:03] [INFO ] Dead Transitions using invariants and state equation in 3144 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10301/10301 places, 20100/20100 transitions.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SharedMemory-PT-000100-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (EQ s9351 0) (EQ s9460 0) (EQ s9636 0)) (OR (EQ s9351 0) (EQ s9461 0) (EQ s9715 0)) (OR (EQ s9351 0) (EQ s9412 0) (EQ s9646 0)) (OR (EQ s9351 ...], 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 timeout after 2370 steps with 0 reset in 10007 ms.
Product exploration timeout after 2480 steps with 0 reset in 10034 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 158 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Interrupted random walk after 4158 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 1092 steps, including 0 resets, run timeout after 6024 ms. (steps per millisecond=0 ) properties seen 0
Probabilistic random walk after 104666 steps, saw 104422 distinct states, run finished after 108370 ms. (steps per millisecond=0 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 20100 rows 10301 cols
[2022-05-19 17:53:10] [INFO ] Computed 201 place invariants in 2022 ms
[2022-05-19 17:53:15] [INFO ] [Real]Absence check using 201 positive place invariants in 1037 ms returned sat
[2022-05-19 17:53:24] [INFO ] After 13991ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 10101 out of 10301 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10301/10301 places, 20100/20100 transitions.
Free-agglomeration rule applied 100 times.
Iterating global reduction 0 with 100 rules applied. Total rules applied 100 place count 10301 transition count 20000
Reduce places removed 100 places and 0 transitions.
Drop transitions removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 200 rules applied. Total rules applied 300 place count 10201 transition count 19900
Applied a total of 300 rules in 7658 ms. Remains 10201 /10301 variables (removed 100) and now considering 19900/20100 (removed 200) transitions.
Finished structural reductions, in 1 iterations. Remains : 10201/10301 places, 19900/20100 transitions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 257 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 10101 out of 10301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10301/10301 places, 20100/20100 transitions.
Applied a total of 0 rules in 224 ms. Remains 10301 /10301 variables (removed 0) and now considering 20100/20100 (removed 0) transitions.
// Phase 1: matrix 20100 rows 10301 cols
[2022-05-19 17:53:35] [INFO ] Computed 201 place invariants in 2132 ms
[2022-05-19 17:53:38] [INFO ] Implicit Places using invariants in 4889 ms returned []
Implicit Place search using SMT only with invariants took 4907 ms to find 0 implicit places.
// Phase 1: matrix 20100 rows 10301 cols
[2022-05-19 17:53:39] [INFO ] Computed 201 place invariants in 1844 ms
[2022-05-19 17:53:42] [INFO ] Dead Transitions using invariants and state equation in 4662 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10301/10301 places, 20100/20100 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 257 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Interrupted random walk after 5040 steps, including 1 resets, run timeout after 30013 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 1190 steps, including 0 resets, run timeout after 6125 ms. (steps per millisecond=0 ) properties seen 0
Probabilistic random walk after 113380 steps, saw 113130 distinct states, run finished after 108869 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 20100 rows 10301 cols
[2022-05-19 17:56:30] [INFO ] Computed 201 place invariants in 1942 ms
[2022-05-19 17:56:34] [INFO ] [Real]Absence check using 201 positive place invariants in 706 ms returned sat
[2022-05-19 17:56:43] [INFO ] After 13390ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 10101 out of 10301 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10301/10301 places, 20100/20100 transitions.
Free-agglomeration rule applied 100 times.
Iterating global reduction 0 with 100 rules applied. Total rules applied 100 place count 10301 transition count 20000
Reduce places removed 100 places and 0 transitions.
Drop transitions removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 200 rules applied. Total rules applied 300 place count 10201 transition count 19900
Applied a total of 300 rules in 7300 ms. Remains 10201 /10301 variables (removed 100) and now considering 19900/20100 (removed 200) transitions.
Finished structural reductions, in 1 iterations. Remains : 10201/10301 places, 19900/20100 transitions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 254 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration timeout after 2540 steps with 0 reset in 10027 ms.
Product exploration timeout after 2500 steps with 0 reset in 10011 ms.
Built C files in :
/tmp/ltsmin15582263691188437671
[2022-05-19 17:57:12] [INFO ] Too many transitions (20100) to apply POR reductions. Disabling POR matrices.
[2022-05-19 17:57:12] [INFO ] Built C files in 225ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15582263691188437671
Running compilation step : cd /tmp/ltsmin15582263691188437671;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15582263691188437671;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15582263691188437671;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 10101 out of 10301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10301/10301 places, 20100/20100 transitions.
Applied a total of 0 rules in 138 ms. Remains 10301 /10301 variables (removed 0) and now considering 20100/20100 (removed 0) transitions.
// Phase 1: matrix 20100 rows 10301 cols
[2022-05-19 17:57:17] [INFO ] Computed 201 place invariants in 1884 ms
[2022-05-19 17:57:20] [INFO ] Implicit Places using invariants in 4598 ms returned []
Implicit Place search using SMT only with invariants took 4614 ms to find 0 implicit places.
// Phase 1: matrix 20100 rows 10301 cols
[2022-05-19 17:57:22] [INFO ] Computed 201 place invariants in 1973 ms
[2022-05-19 17:57:23] [INFO ] Dead Transitions using invariants and state equation in 3315 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10301/10301 places, 20100/20100 transitions.
Built C files in :
/tmp/ltsmin8495270270779113937
[2022-05-19 17:57:23] [INFO ] Too many transitions (20100) to apply POR reductions. Disabling POR matrices.
[2022-05-19 17:57:23] [INFO ] Built C files in 187ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8495270270779113937
Running compilation step : cd /tmp/ltsmin8495270270779113937;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8495270270779113937;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8495270270779113937;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-19 17:57:29] [INFO ] Flatten gal took : 889 ms
[2022-05-19 17:57:30] [INFO ] Flatten gal took : 807 ms
[2022-05-19 17:57:30] [INFO ] Time to serialize gal into /tmp/LTL17559460914352465223.gal : 143 ms
[2022-05-19 17:57:30] [INFO ] Time to serialize properties into /tmp/LTL11130328081376671840.ltl : 89 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17559460914352465223.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11130328081376671840.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1755946...268
Read 1 LTL properties
Checking formula 0 : !((X(F(G(F((F("(((((((((((((((((Ext_Bus==0)||(Memory_38==0))||(Queue_28==0))&&(((Ext_Bus==0)||(Memory_43==0))||(Queue_80==0)))&&((((Ex...759175
Formula 0 simplified : !XFGF("(((((((((((((((Ext_Mem_Acc_94_13==0)&&(Ext_Mem_Acc_52_4==0))&&((Ext_Mem_Acc_100_43==0)&&(Ext_Mem_Acc_56_26==0)))&&(((Ext_Mem_...759162
Detected timeout of ITS tools.
[2022-05-19 17:57:47] [INFO ] Flatten gal took : 985 ms
[2022-05-19 17:57:47] [INFO ] Applying decomposition
[2022-05-19 17:57:48] [INFO ] Flatten gal took : 996 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3330766476474784677.txt' '-o' '/tmp/graph3330766476474784677.bin' '-w' '/tmp/graph3330766476474784677.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3330766476474784677.bin' '-l' '-1' '-v' '-w' '/tmp/graph3330766476474784677.weights' '-q' '0' '-e' '0.001'
[2022-05-19 17:57:50] [INFO ] Decomposing Gal with order
[2022-05-19 17:57:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 17:57:55] [INFO ] Removed a total of 39002 redundant transitions.
[2022-05-19 17:57:56] [INFO ] Flatten gal took : 4053 ms
[2022-05-19 17:57:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 1124 labels/synchronizations in 657 ms.
[2022-05-19 17:57:58] [INFO ] Time to serialize gal into /tmp/LTL11274313808427716036.gal : 144 ms
[2022-05-19 17:57:58] [INFO ] Time to serialize properties into /tmp/LTL4503370568890457032.ltl : 55 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11274313808427716036.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4503370568890457032.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1127431...246
Read 1 LTL properties
Checking formula 0 : !((X(F(G(F((F("(((((((((((((((((i45.u48.Ext_Bus==0)||(u71.Memory_38==0))||(u93.Queue_28==0))&&(((i45.u48.Ext_Bus==0)||(u72.Memory_43==...979532
Formula 0 simplified : !XFGF("(((((((((((((((u8.Ext_Mem_Acc_94_13==0)&&(u186.Ext_Mem_Acc_52_4==0))&&((u72.Ext_Mem_Acc_100_43==0)&&(u173.Ext_Mem_Acc_56_26==...979519
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15283260778705776168
[2022-05-19 17:58:13] [INFO ] Built C files in 187ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15283260778705776168
Running compilation step : cd /tmp/ltsmin15283260778705776168;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15283260778705776168;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15283260778705776168;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property SharedMemory-PT-000100-LTLFireability-05 finished in 499589 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p1))||p0))))'
Support contains 100 out of 10301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10301/10301 places, 20100/20100 transitions.
Applied a total of 0 rules in 56 ms. Remains 10301 /10301 variables (removed 0) and now considering 20100/20100 (removed 0) transitions.
// Phase 1: matrix 20100 rows 10301 cols
[2022-05-19 17:58:18] [INFO ] Computed 201 place invariants in 2155 ms
[2022-05-19 17:58:19] [INFO ] Implicit Places using invariants in 3133 ms returned []
Implicit Place search using SMT only with invariants took 3134 ms to find 0 implicit places.
// Phase 1: matrix 20100 rows 10301 cols
[2022-05-19 17:58:21] [INFO ] Computed 201 place invariants in 1797 ms
[2022-05-19 17:58:22] [INFO ] Dead Transitions using invariants and state equation in 2712 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10301/10301 places, 20100/20100 transitions.
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SharedMemory-PT-000100-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (EQ s9483 1) (EQ s9548 1) (EQ s9487 1) (EQ s9544 1) (EQ s9475 1) (EQ s9479 1) (EQ s9499 1) (EQ s9564 1) (EQ s9503 1) (EQ s9560 1) (EQ s9491 1) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 5775 ms.
Product exploration explored 100000 steps with 33333 reset in 5377 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 47 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA SharedMemory-PT-000100-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SharedMemory-PT-000100-LTLFireability-06 finished in 17465 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)||X((G(p1)&&X(p1)&&p2)))))'
Support contains 301 out of 10301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10301/10301 places, 20100/20100 transitions.
Applied a total of 0 rules in 28 ms. Remains 10301 /10301 variables (removed 0) and now considering 20100/20100 (removed 0) transitions.
// Phase 1: matrix 20100 rows 10301 cols
[2022-05-19 17:58:35] [INFO ] Computed 201 place invariants in 1816 ms
[2022-05-19 17:58:36] [INFO ] Implicit Places using invariants in 2716 ms returned []
Implicit Place search using SMT only with invariants took 2717 ms to find 0 implicit places.
// Phase 1: matrix 20100 rows 10301 cols
[2022-05-19 17:58:38] [INFO ] Computed 201 place invariants in 1793 ms
[2022-05-19 17:58:39] [INFO ] Dead Transitions using invariants and state equation in 2705 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10301/10301 places, 20100/20100 transitions.
Stuttering acceptance computed with spot in 177 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SharedMemory-PT-000100-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (EQ s9351 1) (EQ s9460 1) (EQ s9636 1)) (AND (EQ s9351 1) (EQ s9461 1) (EQ s9715 1)) (AND (EQ s9351 1) (EQ s9412 1) (EQ s9646 1)) (AND (EQ s93...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 8260 steps with 2717 reset in 10026 ms.
Product exploration timeout after 8440 steps with 2841 reset in 10015 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) p2 p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 4 factoid took 359 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 145 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Finished random walk after 323 steps, including 0 resets, run visited all 4 properties in 332 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) p2 p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT (AND (NOT p0) p1))), (F (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p2 (NOT p0) p1)))]
Knowledge based reduction with 4 factoid took 537 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 256 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 181 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Support contains 301 out of 10301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10301/10301 places, 20100/20100 transitions.
Applied a total of 0 rules in 52 ms. Remains 10301 /10301 variables (removed 0) and now considering 20100/20100 (removed 0) transitions.
// Phase 1: matrix 20100 rows 10301 cols
[2022-05-19 17:59:55] [INFO ] Computed 201 place invariants in 3464 ms
[2022-05-19 17:59:56] [INFO ] Implicit Places using invariants in 5174 ms returned []
Implicit Place search using SMT only with invariants took 5175 ms to find 0 implicit places.
// Phase 1: matrix 20100 rows 10301 cols
[2022-05-19 18:00:00] [INFO ] Computed 201 place invariants in 3483 ms
[2022-05-19 18:00:01] [INFO ] Dead Transitions using invariants and state equation in 5196 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10301/10301 places, 20100/20100 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1)))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p2 (NOT p0) p1)), (X (NOT (AND p2 (NOT p0) p1))), (X (X (AND p2 (NOT p0) p1))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 4 factoid took 181 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 159 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Finished random walk after 359 steps, including 0 resets, run visited all 4 properties in 219 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1)))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p2 (NOT p0) p1)), (X (NOT (AND p2 (NOT p0) p1))), (X (X (AND p2 (NOT p0) p1))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT (AND (NOT p0) p1))), (F (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p2 (NOT p0) p1)))]
Knowledge based reduction with 4 factoid took 503 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 152 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 136 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 153 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Product exploration timeout after 7170 steps with 2406 reset in 10017 ms.
Product exploration timeout after 8900 steps with 2918 reset in 10001 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 143 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Support contains 301 out of 10301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10301/10301 places, 20100/20100 transitions.
Applied a total of 0 rules in 231 ms. Remains 10301 /10301 variables (removed 0) and now considering 20100/20100 (removed 0) transitions.
// Phase 1: matrix 20100 rows 10301 cols
[2022-05-19 18:01:06] [INFO ] Computed 201 place invariants in 3431 ms
[2022-05-19 18:01:08] [INFO ] Dead Transitions using invariants and state equation in 5327 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10301/10301 places, 20100/20100 transitions.
Product exploration timeout after 4800 steps with 1626 reset in 10009 ms.
Product exploration timeout after 4510 steps with 1497 reset in 10008 ms.
Built C files in :
/tmp/ltsmin16718297056328630042
[2022-05-19 18:01:28] [INFO ] Built C files in 300ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16718297056328630042
Running compilation step : cd /tmp/ltsmin16718297056328630042;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16718297056328630042;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16718297056328630042;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 301 out of 10301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10301/10301 places, 20100/20100 transitions.
Applied a total of 0 rules in 80 ms. Remains 10301 /10301 variables (removed 0) and now considering 20100/20100 (removed 0) transitions.
// Phase 1: matrix 20100 rows 10301 cols
[2022-05-19 18:01:34] [INFO ] Computed 201 place invariants in 3134 ms
[2022-05-19 18:01:40] [INFO ] Implicit Places using invariants in 8932 ms returned []
Implicit Place search using SMT only with invariants took 8933 ms to find 0 implicit places.
// Phase 1: matrix 20100 rows 10301 cols
[2022-05-19 18:01:44] [INFO ] Computed 201 place invariants in 3727 ms
[2022-05-19 18:01:45] [INFO ] Dead Transitions using invariants and state equation in 5048 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10301/10301 places, 20100/20100 transitions.
Built C files in :
/tmp/ltsmin16222894967030178344
[2022-05-19 18:01:45] [INFO ] Built C files in 108ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16222894967030178344
Running compilation step : cd /tmp/ltsmin16222894967030178344;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16222894967030178344;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16222894967030178344;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-19 18:01:53] [INFO ] Flatten gal took : 1795 ms
[2022-05-19 18:01:55] [INFO ] Flatten gal took : 1820 ms
[2022-05-19 18:01:55] [INFO ] Time to serialize gal into /tmp/LTL3317401449366860704.gal : 176 ms
[2022-05-19 18:01:56] [INFO ] Time to serialize properties into /tmp/LTL18329344707833759809.ltl : 129 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3317401449366860704.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18329344707833759809.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3317401...267
Read 1 LTL properties
Checking formula 0 : !((F((F("(((((((((((((((((Ext_Bus==1)&&(Memory_38==1))&&(Queue_28==1))||(((Ext_Bus==1)&&(Memory_43==1))&&(Queue_80==1)))||((((Ext_Bus=...508743
Formula 0 simplified : !F(F"(((((((((((((((((Ext_Bus==1)&&(Memory_38==1))&&(Queue_28==1))||(((Ext_Bus==1)&&(Memory_43==1))&&(Queue_80==1)))||((((Ext_Bus==1...508726
Detected timeout of ITS tools.
[2022-05-19 18:02:13] [INFO ] Flatten gal took : 1765 ms
[2022-05-19 18:02:13] [INFO ] Applying decomposition
[2022-05-19 18:02:14] [INFO ] Flatten gal took : 1281 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3275030244019190776.txt' '-o' '/tmp/graph3275030244019190776.bin' '-w' '/tmp/graph3275030244019190776.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3275030244019190776.bin' '-l' '-1' '-v' '-w' '/tmp/graph3275030244019190776.weights' '-q' '0' '-e' '0.001'
[2022-05-19 18:02:17] [INFO ] Decomposing Gal with order
[2022-05-19 18:02:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 18:02:24] [INFO ] Removed a total of 39002 redundant transitions.
[2022-05-19 18:02:25] [INFO ] Flatten gal took : 4361 ms
[2022-05-19 18:02:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 1124 labels/synchronizations in 882 ms.
[2022-05-19 18:02:27] [INFO ] Time to serialize gal into /tmp/LTL11749628901515055003.gal : 126 ms
[2022-05-19 18:02:27] [INFO ] Time to serialize properties into /tmp/LTL2146867553024072025.ltl : 57 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11749628901515055003.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2146867553024072025.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1174962...246
Read 1 LTL properties
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2581449658801577254
[2022-05-19 18:02:42] [INFO ] Built C files in 360ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2581449658801577254
Running compilation step : cd /tmp/ltsmin2581449658801577254;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2581449658801577254;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2581449658801577254;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property SharedMemory-PT-000100-LTLFireability-07 finished in 251757 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!X(p0)) U !X(p1))))'
Support contains 5 out of 10301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10301/10301 places, 20100/20100 transitions.
Applied a total of 0 rules in 5481 ms. Remains 10301 /10301 variables (removed 0) and now considering 20100/20100 (removed 0) transitions.
// Phase 1: matrix 20100 rows 10301 cols
[2022-05-19 18:02:55] [INFO ] Computed 201 place invariants in 4392 ms
[2022-05-19 18:03:00] [INFO ] Implicit Places using invariants in 9304 ms returned []
Implicit Place search using SMT only with invariants took 9308 ms to find 0 implicit places.
// Phase 1: matrix 20100 rows 10301 cols
[2022-05-19 18:03:04] [INFO ] Computed 201 place invariants in 3892 ms
[2022-05-19 18:03:07] [INFO ] Dead Transitions using invariants and state equation in 7285 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10301/10301 places, 20100/20100 transitions.
Stuttering acceptance computed with spot in 464 ms :[p1, p1, p1, true, p0]
Running random walk in product with property : SharedMemory-PT-000100-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s9415 1) (EQ s10241 1)), p0:(AND (EQ s9351 1) (EQ s9446 1) (EQ s9604 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 629 steps with 128 reset in 155 ms.
FORMULA SharedMemory-PT-000100-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-PT-000100-LTLFireability-08 finished in 22757 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(F(p1)||G(p2))))'
Support contains 6 out of 10301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10301/10301 places, 20100/20100 transitions.
Applied a total of 0 rules in 6561 ms. Remains 10301 /10301 variables (removed 0) and now considering 20100/20100 (removed 0) transitions.
// Phase 1: matrix 20100 rows 10301 cols
[2022-05-19 18:03:19] [INFO ] Computed 201 place invariants in 4758 ms
[2022-05-19 18:03:23] [INFO ] Implicit Places using invariants in 8629 ms returned []
Implicit Place search using SMT only with invariants took 8646 ms to find 0 implicit places.
// Phase 1: matrix 20100 rows 10301 cols
[2022-05-19 18:03:27] [INFO ] Computed 201 place invariants in 3946 ms
[2022-05-19 18:03:33] [INFO ] Dead Transitions using invariants and state equation in 10153 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10301/10301 places, 20100/20100 transitions.
Stuttering acceptance computed with spot in 536 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), true]
Running random walk in product with property : SharedMemory-PT-000100-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s9583 1), p2:(AND (EQ s9410 1) (EQ s10240 1)), p0:(OR (EQ s9351 0) (EQ s9425 0) (EQ s9651 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 19 steps with 9 reset in 2 ms.
FORMULA SharedMemory-PT-000100-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-PT-000100-LTLFireability-10 finished in 25977 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||X(p1)))'
Support contains 1 out of 10301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10301/10301 places, 20100/20100 transitions.
Applied a total of 0 rules in 79 ms. Remains 10301 /10301 variables (removed 0) and now considering 20100/20100 (removed 0) transitions.
// Phase 1: matrix 20100 rows 10301 cols
[2022-05-19 18:03:39] [INFO ] Computed 201 place invariants in 5166 ms
[2022-05-19 18:03:42] [INFO ] Implicit Places using invariants in 8281 ms returned []
Implicit Place search using SMT only with invariants took 8307 ms to find 0 implicit places.
// Phase 1: matrix 20100 rows 10301 cols
[2022-05-19 18:03:45] [INFO ] Computed 201 place invariants in 2574 ms
[2022-05-19 18:03:46] [INFO ] Dead Transitions using invariants and state equation in 4220 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10301/10301 places, 20100/20100 transitions.
Stuttering acceptance computed with spot in 389 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SharedMemory-PT-000100-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}]], initial=1, aps=[p0:(EQ s9486 1), p1:(EQ s9486 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 35 steps with 0 reset in 3 ms.
FORMULA SharedMemory-PT-000100-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-PT-000100-LTLFireability-11 finished in 13104 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(X(X(X((p0 U p1))))) U !p0)||G(X(p2)))))'
Support contains 5 out of 10301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10301/10301 places, 20100/20100 transitions.
Applied a total of 0 rules in 4058 ms. Remains 10301 /10301 variables (removed 0) and now considering 20100/20100 (removed 0) transitions.
// Phase 1: matrix 20100 rows 10301 cols
[2022-05-19 18:03:54] [INFO ] Computed 201 place invariants in 3002 ms
[2022-05-19 18:03:57] [INFO ] Implicit Places using invariants in 6077 ms returned []
Implicit Place search using SMT only with invariants took 6078 ms to find 0 implicit places.
// Phase 1: matrix 20100 rows 10301 cols
[2022-05-19 18:04:00] [INFO ] Computed 201 place invariants in 3176 ms
[2022-05-19 18:04:02] [INFO ] Dead Transitions using invariants and state equation in 5017 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10301/10301 places, 20100/20100 transitions.
Stuttering acceptance computed with spot in 1286 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p1), (OR (NOT p1) p0), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : SharedMemory-PT-000100-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p2), acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=p2, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 3}, { cond=p0, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 6}, { cond=p2, acceptance={} source=5 dest: 9}], [{ cond=true, acceptance={} source=6 dest: 7}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=7 dest: 7}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=7 dest: 8}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=(NOT p2), acceptance={} source=9 dest: 7}, { cond=p2, acceptance={} source=9 dest: 10}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=10 dest: 7}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=10 dest: 8}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=10 dest: 10}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=10 dest: 11}], [{ cond=(NOT p2), acceptance={} source=11 dest: 8}, { cond=p2, acceptance={} source=11 dest: 11}]], initial=0, aps=[p0:(EQ s9469 1), p2:(AND (EQ s9351 1) (EQ s9409 1) (EQ s9539 1)), p1:(EQ s6388 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 42 ms.
FORMULA SharedMemory-PT-000100-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-PT-000100-LTLFireability-12 finished in 16651 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0)||F(p1)||p2))))'
Support contains 7 out of 10301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10301/10301 places, 20100/20100 transitions.
Applied a total of 0 rules in 4945 ms. Remains 10301 /10301 variables (removed 0) and now considering 20100/20100 (removed 0) transitions.
// Phase 1: matrix 20100 rows 10301 cols
[2022-05-19 18:04:11] [INFO ] Computed 201 place invariants in 2881 ms
[2022-05-19 18:04:14] [INFO ] Implicit Places using invariants in 5411 ms returned []
Implicit Place search using SMT only with invariants took 5413 ms to find 0 implicit places.
// Phase 1: matrix 20100 rows 10301 cols
[2022-05-19 18:04:18] [INFO ] Computed 201 place invariants in 3787 ms
[2022-05-19 18:04:20] [INFO ] Dead Transitions using invariants and state equation in 5761 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10301/10301 places, 20100/20100 transitions.
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : SharedMemory-PT-000100-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s9351 1) (EQ s9415 1) (EQ s9717 1)) (AND (EQ s9450 1) (EQ s9669 1))), p1:(EQ s9512 1), p2:(EQ s9579 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration timeout after 5210 steps with 17 reset in 10085 ms.
Product exploration timeout after 3620 steps with 4 reset in 10036 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
Knowledge based reduction with 2 factoid took 259 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 254 steps, including 0 resets, run visited all 2 properties in 52 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) p2))]
Knowledge based reduction with 2 factoid took 321 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 7 out of 10301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10301/10301 places, 20100/20100 transitions.
Applied a total of 0 rules in 2828 ms. Remains 10301 /10301 variables (removed 0) and now considering 20100/20100 (removed 0) transitions.
// Phase 1: matrix 20100 rows 10301 cols
[2022-05-19 18:04:46] [INFO ] Computed 201 place invariants in 1900 ms
[2022-05-19 18:04:47] [INFO ] Implicit Places using invariants in 2947 ms returned []
Implicit Place search using SMT only with invariants took 2947 ms to find 0 implicit places.
// Phase 1: matrix 20100 rows 10301 cols
[2022-05-19 18:04:49] [INFO ] Computed 201 place invariants in 1922 ms
[2022-05-19 18:04:50] [INFO ] Dead Transitions using invariants and state equation in 2866 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10301/10301 places, 20100/20100 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
Knowledge based reduction with 2 factoid took 375 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 89 steps, including 0 resets, run visited all 2 properties in 11 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) p2))]
Knowledge based reduction with 2 factoid took 214 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration timeout after 5600 steps with 14 reset in 10023 ms.
Stack based approach found an accepted trace after 539 steps with 0 reset with depth 540 and stack size 518 in 978 ms.
FORMULA SharedMemory-PT-000100-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-PT-000100-LTLFireability-13 finished in 58567 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 10301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10301/10301 places, 20100/20100 transitions.
Drop transitions removed 9801 transitions
Trivial Post-agglo rules discarded 9801 transitions
Performed 9801 trivial Post agglomeration. Transition count delta: 9801
Iterating post reduction 0 with 9801 rules applied. Total rules applied 9801 place count 10301 transition count 10299
Reduce places removed 9900 places and 0 transitions.
Ensure Unique test removed 9701 transitions
Reduce isomorphic transitions removed 9701 transitions.
Graph (trivial) has 298 edges and 401 vertex of which 198 / 401 are part of one of the 99 SCC in 0 ms
Free SCC test removed 99 places
Iterating post reduction 1 with 19602 rules applied. Total rules applied 29403 place count 302 transition count 598
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Iterating post reduction 2 with 99 rules applied. Total rules applied 29502 place count 302 transition count 499
Applied a total of 29502 rules in 311 ms. Remains 302 /10301 variables (removed 9999) and now considering 499/20100 (removed 19601) transitions.
[2022-05-19 18:05:02] [INFO ] Flow matrix only has 401 transitions (discarded 98 similar events)
// Phase 1: matrix 401 rows 302 cols
[2022-05-19 18:05:02] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-19 18:05:03] [INFO ] Implicit Places using invariants in 237 ms returned []
[2022-05-19 18:05:03] [INFO ] Flow matrix only has 401 transitions (discarded 98 similar events)
// Phase 1: matrix 401 rows 302 cols
[2022-05-19 18:05:03] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-19 18:05:03] [INFO ] Implicit Places using invariants and state equation in 501 ms returned []
Implicit Place search using SMT with State Equation took 739 ms to find 0 implicit places.
[2022-05-19 18:05:03] [INFO ] Redundant transitions in 24 ms returned []
[2022-05-19 18:05:03] [INFO ] Flow matrix only has 401 transitions (discarded 98 similar events)
// Phase 1: matrix 401 rows 302 cols
[2022-05-19 18:05:03] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-19 18:05:04] [INFO ] Dead Transitions using invariants and state equation in 716 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 302/10301 places, 499/20100 transitions.
Finished structural reductions, in 1 iterations. Remains : 302/10301 places, 499/20100 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0)]
Running random walk in product with property : SharedMemory-PT-000100-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s100 1) (EQ s286 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA SharedMemory-PT-000100-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-PT-000100-LTLFireability-15 finished in 1947 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(F((F(p0)||p1))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)||X((G(p1)&&X(p1)&&p2)))))'
Found a CL insensitive property : SharedMemory-PT-000100-LTLFireability-07
Stuttering acceptance computed with spot in 113 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Support contains 301 out of 10301 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 10301/10301 places, 20100/20100 transitions.
Applied a total of 0 rules in 130 ms. Remains 10301 /10301 variables (removed 0) and now considering 20100/20100 (removed 0) transitions.
// Phase 1: matrix 20100 rows 10301 cols
[2022-05-19 18:05:07] [INFO ] Computed 201 place invariants in 2350 ms
[2022-05-19 18:05:08] [INFO ] Implicit Places using invariants in 3358 ms returned []
Implicit Place search using SMT only with invariants took 3358 ms to find 0 implicit places.
// Phase 1: matrix 20100 rows 10301 cols
[2022-05-19 18:05:10] [INFO ] Computed 201 place invariants in 1851 ms
[2022-05-19 18:05:11] [INFO ] Dead Transitions using invariants and state equation in 2800 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10301/10301 places, 20100/20100 transitions.
Running random walk in product with property : SharedMemory-PT-000100-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (EQ s9351 1) (EQ s9460 1) (EQ s9636 1)) (AND (EQ s9351 1) (EQ s9461 1) (EQ s9715 1)) (AND (EQ s9351 1) (EQ s9412 1) (EQ s9646 1)) (AND (EQ s93...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 8150 steps with 2706 reset in 10005 ms.
Product exploration timeout after 8170 steps with 2712 reset in 10028 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) p2 p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 4 factoid took 187 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 88 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Finished random walk after 238 steps, including 0 resets, run visited all 4 properties in 205 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) p2 p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT (AND (NOT p0) p1))), (F (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p2 (NOT p0) p1)))]
Knowledge based reduction with 4 factoid took 755 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 183 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 174 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Support contains 301 out of 10301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10301/10301 places, 20100/20100 transitions.
Applied a total of 0 rules in 79 ms. Remains 10301 /10301 variables (removed 0) and now considering 20100/20100 (removed 0) transitions.
// Phase 1: matrix 20100 rows 10301 cols
[2022-05-19 18:06:17] [INFO ] Computed 201 place invariants in 3714 ms
[2022-05-19 18:06:18] [INFO ] Implicit Places using invariants in 5450 ms returned []
Implicit Place search using SMT only with invariants took 5451 ms to find 0 implicit places.
// Phase 1: matrix 20100 rows 10301 cols
[2022-05-19 18:06:22] [INFO ] Computed 201 place invariants in 3775 ms
[2022-05-19 18:06:24] [INFO ] Dead Transitions using invariants and state equation in 5548 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10301/10301 places, 20100/20100 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1)))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p2 (NOT p0) p1)), (X (NOT (AND p2 (NOT p0) p1))), (X (X (AND p2 (NOT p0) p1))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 4 factoid took 225 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 141 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Finished random walk after 355 steps, including 0 resets, run visited all 4 properties in 181 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1)))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p2 (NOT p0) p1)), (X (NOT (AND p2 (NOT p0) p1))), (X (X (AND p2 (NOT p0) p1))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT (AND (NOT p0) p1))), (F (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p2 (NOT p0) p1)))]
Knowledge based reduction with 4 factoid took 261 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 78 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 110 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Product exploration timeout after 10480 steps with 3473 reset in 10007 ms.
Product exploration timeout after 9630 steps with 3227 reset in 10004 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 78 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Support contains 301 out of 10301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10301/10301 places, 20100/20100 transitions.
Applied a total of 0 rules in 234 ms. Remains 10301 /10301 variables (removed 0) and now considering 20100/20100 (removed 0) transitions.
// Phase 1: matrix 20100 rows 10301 cols
[2022-05-19 18:07:16] [INFO ] Computed 201 place invariants in 2911 ms
[2022-05-19 18:07:19] [INFO ] Dead Transitions using invariants and state equation in 5625 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10301/10301 places, 20100/20100 transitions.
Product exploration timeout after 6410 steps with 2124 reset in 10042 ms.
Product exploration timeout after 8230 steps with 2715 reset in 10050 ms.
Built C files in :
/tmp/ltsmin6809899501959036564
[2022-05-19 18:07:39] [INFO ] Built C files in 126ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6809899501959036564
Running compilation step : cd /tmp/ltsmin6809899501959036564;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6809899501959036564;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6809899501959036564;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 301 out of 10301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10301/10301 places, 20100/20100 transitions.
Applied a total of 0 rules in 38 ms. Remains 10301 /10301 variables (removed 0) and now considering 20100/20100 (removed 0) transitions.
// Phase 1: matrix 20100 rows 10301 cols
[2022-05-19 18:07:44] [INFO ] Computed 201 place invariants in 1883 ms
[2022-05-19 18:07:45] [INFO ] Implicit Places using invariants in 2835 ms returned []
Implicit Place search using SMT only with invariants took 2835 ms to find 0 implicit places.
// Phase 1: matrix 20100 rows 10301 cols
[2022-05-19 18:07:47] [INFO ] Computed 201 place invariants in 1838 ms
[2022-05-19 18:07:48] [INFO ] Dead Transitions using invariants and state equation in 2786 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10301/10301 places, 20100/20100 transitions.
Built C files in :
/tmp/ltsmin2372659576772623270
[2022-05-19 18:07:48] [INFO ] Built C files in 106ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2372659576772623270
Running compilation step : cd /tmp/ltsmin2372659576772623270;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2372659576772623270;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2372659576772623270;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-19 18:07:53] [INFO ] Flatten gal took : 1081 ms
[2022-05-19 18:07:54] [INFO ] Flatten gal took : 775 ms
[2022-05-19 18:07:54] [INFO ] Time to serialize gal into /tmp/LTL2518044214394770932.gal : 63 ms
[2022-05-19 18:07:54] [INFO ] Time to serialize properties into /tmp/LTL8452007440082024162.ltl : 23 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2518044214394770932.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8452007440082024162.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2518044...266
Read 1 LTL properties
Checking formula 0 : !((F((F("(((((((((((((((((Ext_Bus==1)&&(Memory_38==1))&&(Queue_28==1))||(((Ext_Bus==1)&&(Memory_43==1))&&(Queue_80==1)))||((((Ext_Bus=...508743
Formula 0 simplified : !F(F"(((((((((((((((((Ext_Bus==1)&&(Memory_38==1))&&(Queue_28==1))||(((Ext_Bus==1)&&(Memory_43==1))&&(Queue_80==1)))||((((Ext_Bus==1...508726
Detected timeout of ITS tools.
[2022-05-19 18:08:10] [INFO ] Flatten gal took : 838 ms
[2022-05-19 18:08:10] [INFO ] Applying decomposition
[2022-05-19 18:08:11] [INFO ] Flatten gal took : 910 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9455684700306255126.txt' '-o' '/tmp/graph9455684700306255126.bin' '-w' '/tmp/graph9455684700306255126.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9455684700306255126.bin' '-l' '-1' '-v' '-w' '/tmp/graph9455684700306255126.weights' '-q' '0' '-e' '0.001'
[2022-05-19 18:08:13] [INFO ] Decomposing Gal with order
[2022-05-19 18:08:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 18:08:17] [INFO ] Removed a total of 39002 redundant transitions.
[2022-05-19 18:08:18] [INFO ] Flatten gal took : 2750 ms
[2022-05-19 18:08:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 938 labels/synchronizations in 815 ms.
[2022-05-19 18:08:19] [INFO ] Time to serialize gal into /tmp/LTL10341299317347525837.gal : 97 ms
[2022-05-19 18:08:19] [INFO ] Time to serialize properties into /tmp/LTL7678836599319187255.ltl : 35 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10341299317347525837.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7678836599319187255.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1034129...246
Read 1 LTL properties
Checking formula 0 : !((F((F("(((((((((((((((((i38.u40.Ext_Bus==1)&&(u71.Memory_38==1))&&(u164.Queue_28==1))||(((i38.u40.Ext_Bus==1)&&(u72.Memory_43==1))&&...684510
Formula 0 simplified : !F(F"(((((((((((((((((i38.u40.Ext_Bus==1)&&(u71.Memory_38==1))&&(u164.Queue_28==1))||(((i38.u40.Ext_Bus==1)&&(u72.Memory_43==1))&&(u...684493
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18345411064391310531
[2022-05-19 18:08:35] [INFO ] Built C files in 264ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18345411064391310531
Running compilation step : cd /tmp/ltsmin18345411064391310531;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18345411064391310531;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18345411064391310531;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property SharedMemory-PT-000100-LTLFireability-07 finished in 213292 ms.
[2022-05-19 18:08:40] [INFO ] Flatten gal took : 1748 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14907825442084512347
[2022-05-19 18:08:41] [INFO ] Too many transitions (20100) to apply POR reductions. Disabling POR matrices.
[2022-05-19 18:08:42] [INFO ] Built C files in 667ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14907825442084512347
Running compilation step : cd /tmp/ltsmin14907825442084512347;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-19 18:08:43] [INFO ] Applying decomposition
[2022-05-19 18:08:45] [INFO ] Flatten gal took : 2106 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15917466337158763185.txt' '-o' '/tmp/graph15917466337158763185.bin' '-w' '/tmp/graph15917466337158763185.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15917466337158763185.bin' '-l' '-1' '-v' '-w' '/tmp/graph15917466337158763185.weights' '-q' '0' '-e' '0.001'
[2022-05-19 18:08:49] [INFO ] Decomposing Gal with order
[2022-05-19 18:08:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 18:08:56] [INFO ] Removed a total of 39002 redundant transitions.
[2022-05-19 18:08:58] [INFO ] Flatten gal took : 5687 ms
[2022-05-19 18:09:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 1164 labels/synchronizations in 1498 ms.
[2022-05-19 18:09:00] [INFO ] Time to serialize gal into /tmp/LTLFireability5155283112218555693.gal : 71 ms
[2022-05-19 18:09:00] [INFO ] Time to serialize properties into /tmp/LTLFireability12346997413000940727.ltl : 309 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5155283112218555693.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12346997413000940727.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 2 LTL properties
Checking formula 0 : !((X(F(G(F((F("(((((((((((((((((i1.u1.Ext_Bus==0)||(u71.Memory_38==0))||(u92.Queue_28==0))&&(((i1.u1.Ext_Bus==0)||(u72.Memory_43==0))|...957855
Formula 0 simplified : !XFGF("(((((((((((((((u8.Ext_Mem_Acc_94_13==0)&&(u7.Ext_Mem_Acc_52_4==0))&&((i1.u131.Ext_Mem_Acc_100_43==0)&&(u58.Ext_Mem_Acc_56_26=...957842
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14907825442084512347;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 360 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14907825442084512347;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 360 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
1 unique states visited
0 strongly connected components in search stack
1 transitions explored
1 items max in DFS search stack
64922 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,661.383,4361540,1,0,6.43071e+06,585195,230923,9.87927e+06,27852,4.00339e+06,44929632
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA SharedMemory-PT-000100-LTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F((F("(((((((((((((((((i1.u1.Ext_Bus==1)&&(u71.Memory_38==1))&&(u92.Queue_28==1))||(((i1.u1.Ext_Bus==1)&&(u72.Memory_43==1))&&(u138...662508
Formula 1 simplified : !F(F"(((((((((((((((((i1.u1.Ext_Bus==1)&&(u71.Memory_38==1))&&(u92.Queue_28==1))||(((i1.u1.Ext_Bus==1)&&(u72.Memory_43==1))&&(u138.Q...662491
4 unique states visited
3 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
10518 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,766.599,5659700,1,0,7.92043e+06,585195,156545,1.29e+07,2552,4.00339e+06,12421134
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA SharedMemory-PT-000100-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 2141963 ms.
BK_STOP 1652984582024
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m
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-000100"
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-000100, 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 r204-oct2-165281599600692"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SharedMemory-PT-000100.tgz
mv SharedMemory-PT-000100 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 '
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 ;