About the Execution of ITS-Tools for S_ResAllocation-PT-R100C002
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5757.110 | 1754130.00 | 2082721.00 | 278.10 | FTFFTFFFFFFFTFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
.......
=====================================================================
Generated by BenchKit 2-3254
Executing tool itstools
Input is S_ResAllocation-PT-R100C002, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r150-csrt-149443434700122
=====================================================================
--------------------
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 ResAllocation-PT-R100C002-LTLCardinality-0
FORMULA_NAME ResAllocation-PT-R100C002-LTLCardinality-1
FORMULA_NAME ResAllocation-PT-R100C002-LTLCardinality-10
FORMULA_NAME ResAllocation-PT-R100C002-LTLCardinality-11
FORMULA_NAME ResAllocation-PT-R100C002-LTLCardinality-12
FORMULA_NAME ResAllocation-PT-R100C002-LTLCardinality-13
FORMULA_NAME ResAllocation-PT-R100C002-LTLCardinality-14
FORMULA_NAME ResAllocation-PT-R100C002-LTLCardinality-15
FORMULA_NAME ResAllocation-PT-R100C002-LTLCardinality-2
FORMULA_NAME ResAllocation-PT-R100C002-LTLCardinality-3
FORMULA_NAME ResAllocation-PT-R100C002-LTLCardinality-4
FORMULA_NAME ResAllocation-PT-R100C002-LTLCardinality-5
FORMULA_NAME ResAllocation-PT-R100C002-LTLCardinality-6
FORMULA_NAME ResAllocation-PT-R100C002-LTLCardinality-7
FORMULA_NAME ResAllocation-PT-R100C002-LTLCardinality-8
FORMULA_NAME ResAllocation-PT-R100C002-LTLCardinality-9
=== Now, execution of the tool begins
BK_START 1496653921576
Using solver YICES2 to compute partial order matrices.
Built C files in :
/home/mcc/execution
its-ltl command run as :
/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201705302212/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !(((G(F("r_0_15>=3")))U(("p_1_6>=1")U("p_0_32>=3"))))
Formula 0 simplified : !(GF"r_0_15>=3" U ("p_1_6>=1" U "p_0_32>=3"))
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 202 rows 400 cols
invariant : -1'p_0_36 + -1'r_0_36 + 1'r_1_36= 0
invariant : -1'p_0_79 + -1'r_0_79 + 1'r_1_79= 0
invariant : -1'p_0_99 + -1'r_0_99 + 1'r_1_99= 0
invariant : -1'p_0_21 + -1'r_0_21 + 1'r_1_21= 0
invariant : 1'p_0_8 + 1'r_0_8 + 1'p_1_8= 1
invariant : 1'p_0_36 + 1'r_0_36 + 1'p_1_36= 1
invariant : -1'p_0_76 + -1'r_0_76 + 1'r_1_76= 0
invariant : 1'p_0_41 + 1'r_0_41 + 1'p_1_41= 1
invariant : -1'p_0_66 + -1'r_0_66 + 1'r_1_66= 0
invariant : 1'p_0_90 + 1'r_0_90 + 1'p_1_90= 1
invariant : -1'p_0_57 + -1'r_0_57 + 1'r_1_57= 0
invariant : -1'p_0_59 + -1'r_0_59 + 1'r_1_59= 0
invariant : 1'p_0_15 + 1'r_0_15 + 1'p_1_15= 1
invariant : -1'p_0_11 + -1'r_0_11 + 1'r_1_11= 0
invariant : -1'p_0_23 + -1'r_0_23 + 1'r_1_23= 0
invariant : -1'p_0_84 + -1'r_0_84 + 1'r_1_84= 0
invariant : -1'p_0_22 + -1'r_0_22 + 1'r_1_22= 0
invariant : 1'p_0_60 + 1'r_0_60 + 1'p_1_60= 1
invariant : 1'p_0_0 + 1'r_0_0 + 1'p_1_0= 1
invariant : 1'p_0_25 + 1'r_0_25 + 1'p_1_25= 1
invariant : -1'p_0_37 + -1'r_0_37 + 1'r_1_37= 0
invariant : -1'p_0_85 + -1'r_0_85 + 1'r_1_85= 0
invariant : -1'p_0_35 + -1'r_0_35 + 1'r_1_35= 0
invariant : -1'p_0_78 + -1'r_0_78 + 1'r_1_78= 0
invariant : -1'p_0_2 + -1'r_0_2 + 1'r_1_2= 0
invariant : 1'p_0_9 + 1'r_0_9 + 1'p_1_9= 1
invariant : 1'p_0_30 + 1'r_0_30 + 1'p_1_30= 1
invariant : 1'p_0_7 + 1'r_0_7 + 1'p_1_7= 1
invariant : 1'p_0_86 + 1'r_0_86 + 1'p_1_86= 1
invariant : -1'p_0_32 + -1'r_0_32 + 1'r_1_32= 0
invariant : 1'p_0_50 + 1'r_0_50 + 1'p_1_50= 1
invariant : 1'p_0_81 + 1'r_0_81 + 1'p_1_81= 1
invariant : 1'p_0_24 + 1'r_0_24 + 1'p_1_24= 1
invariant : -1'p_0_58 + -1'r_0_58 + 1'r_1_58= 0
invariant : -1'p_0_8 + -1'r_0_8 + 1'r_1_8= 0
invariant : 1'p_0_5 + 1'r_0_5 + 1'p_1_5= 1
invariant : -1'p_0_62 + -1'r_0_62 + 1'r_1_62= 0
invariant : -1'p_0_86 + -1'r_0_86 + 1'r_1_86= 0
invariant : -1'p_0_87 + -1'r_0_87 + 1'r_1_87= 0
invariant : 1'p_0_93 + 1'r_0_93 + 1'p_1_93= 1
invariant : 1'p_0_42 + 1'r_0_42 + 1'p_1_42= 1
invariant : -1'p_0_53 + -1'r_0_53 + 1'r_1_53= 0
invariant : 1'p_0_33 + 1'r_0_33 + 1'p_1_33= 1
invariant : -1'p_0_69 + -1'r_0_69 + 1'r_1_69= 0
invariant : 1'p_0_57 + 1'r_0_57 + 1'p_1_57= 1
invariant : -1'p_0_75 + -1'r_0_75 + 1'r_1_75= 0
invariant : -1'p_0_95 + -1'r_0_95 + 1'r_1_95= 0
invariant : 1'p_0_40 + 1'r_0_40 + 1'p_1_40= 1
invariant : 1'p_0_88 + 1'r_0_88 + 1'p_1_88= 1
invariant : -1'p_0_88 + -1'r_0_88 + 1'r_1_88= 0
invariant : 1'p_0_56 + 1'r_0_56 + 1'p_1_56= 1
invariant : 1'p_0_51 + 1'r_0_51 + 1'p_1_51= 1
invariant : 1'p_0_1 + 1'r_0_1 + 1'p_1_1= 1
invariant : 1'p_0_72 + 1'r_0_72 + 1'p_1_72= 1
invariant : -1'p_0_28 + -1'r_0_28 + 1'r_1_28= 0
invariant : 1'p_0_53 + 1'r_0_53 + 1'p_1_53= 1
invariant : 1'p_0_75 + 1'r_0_75 + 1'p_1_75= 1
invariant : -1'p_0_16 + -1'r_0_16 + 1'r_1_16= 0
invariant : -1'p_0_98 + -1'r_0_98 + 1'r_1_98= 0
invariant : 1'p_0_65 + 1'r_0_65 + 1'p_1_65= 1
invariant : -1'p_0_52 + -1'r_0_52 + 1'r_1_52= 0
invariant : -1'p_0_96 + -1'r_0_96 + 1'r_1_96= 0
invariant : -1'p_0_31 + -1'r_0_31 + 1'r_1_31= 0
invariant : 1'p_0_32 + 1'r_0_32 + 1'p_1_32= 1
invariant : 1'p_0_39 + 1'r_0_39 + 1'p_1_39= 1
invariant : 1'p_0_44 + 1'r_0_44 + 1'p_1_44= 1
invariant : 1'p_0_77 + 1'r_0_77 + 1'p_1_77= 1
invariant : 1'p_0_96 + 1'r_0_96 + 1'p_1_96= 1
invariant : 1'p_0_52 + 1'r_0_52 + 1'p_1_52= 1
invariant : 1'p_0_73 + 1'r_0_73 + 1'p_1_73= 1
invariant : 1'p_0_58 + 1'r_0_58 + 1'p_1_58= 1
invariant : 1'p_0_87 + 1'r_0_87 + 1'p_1_87= 1
invariant : -1'p_0_38 + -1'r_0_38 + 1'r_1_38= 0
invariant : -1'p_0_9 + -1'r_0_9 + 1'r_1_9= 0
invariant : 1'p_0_55 + 1'r_0_55 + 1'p_1_55= 1
invariant : 1'p_0_4 + 1'r_0_4 + 1'p_1_4= 1
invariant : 1'p_0_71 + 1'r_0_71 + 1'p_1_71= 1
invariant : 1'p_0_19 + 1'r_0_19 + 1'p_1_19= 1
invariant : -1'p_0_50 + -1'r_0_50 + 1'r_1_50= 0
invariant : 1'p_0_64 + 1'r_0_64 + 1'p_1_64= 1
invariant : -1'p_0_72 + -1'r_0_72 + 1'r_1_72= 0
invariant : -1'p_0_92 + -1'r_0_92 + 1'r_1_92= 0
invariant : 1'p_0_69 + 1'r_0_69 + 1'p_1_69= 1
invariant : -1'p_0_39 + -1'r_0_39 + 1'r_1_39= 0
invariant : -1'p_0_44 + -1'r_0_44 + 1'r_1_44= 0
invariant : 1'p_0_27 + 1'r_0_27 + 1'p_1_27= 1
invariant : 1'p_0_89 + 1'r_0_89 + 1'p_1_89= 1
invariant : -1'p_0_80 + -1'r_0_80 + 1'r_1_80= 0
invariant : -1'p_0_56 + -1'r_0_56 + 1'r_1_56= 0
invariant : 1'p_0_35 + 1'r_0_35 + 1'p_1_35= 1
invariant : -1'p_0_51 + -1'r_0_51 + 1'r_1_51= 0
invariant : 1'p_0_99 + 1'r_0_99 + 1'p_1_99= 1
invariant : 1'p_0_47 + 1'r_0_47 + 1'p_1_47= 1
invariant : 1'p_0_61 + 1'r_0_61 + 1'p_1_61= 1
invariant : -1'p_0_73 + -1'r_0_73 + 1'r_1_73= 0
invariant : 1'p_0_34 + 1'r_0_34 + 1'p_1_34= 1
invariant : -1'p_0_90 + -1'r_0_90 + 1'r_1_90= 0
invariant : -1'p_0_41 + -1'r_0_41 + 1'r_1_41= 0
invariant : 1'p_0_62 + 1'r_0_62 + 1'p_1_62= 1
invariant : 1'p_0_79 + 1'r_0_79 + 1'p_1_79= 1
invariant : -1'p_0_14 + -1'r_0_14 + 1'r_1_14= 0
invariant : -1'p_0_42 + -1'r_0_42 + 1'r_1_42= 0
invariant : 1'p_0_91 + 1'r_0_91 + 1'p_1_91= 1
invariant : -1'p_0_94 + -1'r_0_94 + 1'r_1_94= 0
invariant : 1'p_0_23 + 1'r_0_23 + 1'p_1_23= 1
invariant : -1'p_0_5 + -1'r_0_5 + 1'r_1_5= 0
invariant : -1'p_0_89 + -1'r_0_89 + 1'r_1_89= 0
invariant : -1'p_0_27 + -1'r_0_27 + 1'r_1_27= 0
invariant : 1'p_0_28 + 1'r_0_28 + 1'p_1_28= 1
invariant : -1'p_0_91 + -1'r_0_91 + 1'r_1_91= 0
invariant : -1'p_0_25 + -1'r_0_25 + 1'r_1_25= 0
invariant : -1'p_0_3 + -1'r_0_3 + 1'r_1_3= 0
invariant : 1'p_0_2 + 1'r_0_2 + 1'p_1_2= 1
invariant : 1'p_0_22 + 1'r_0_22 + 1'p_1_22= 1
invariant : -1'p_0_4 + -1'r_0_4 + 1'r_1_4= 0
invariant : 1'p_0_6 + 1'r_0_6 + 1'p_1_6= 1
invariant : 1'p_0_45 + 1'r_0_45 + 1'p_1_45= 1
invariant : -1'p_0_0 + -1'r_0_0 + 1'r_1_0= 0
invariant : 1'p_0_46 + 1'r_0_46 + 1'p_1_46= 1
invariant : 1'p_0_92 + 1'r_0_92 + 1'p_1_92= 1
invariant : -1'p_0_65 + -1'r_0_65 + 1'r_1_65= 0
invariant : -1'p_0_13 + -1'r_0_13 + 1'r_1_13= 0
invariant : -1'p_0_49 + -1'r_0_49 + 1'r_1_49= 0
invariant : -1'p_0_45 + -1'r_0_45 + 1'r_1_45= 0
invariant : -1'p_0_77 + -1'r_0_77 + 1'r_1_77= 0
invariant : -1'p_0_74 + -1'r_0_74 + 1'r_1_74= 0
invariant : -1'p_0_34 + -1'r_0_34 + 1'r_1_34= 0
invariant : 1'p_0_68 + 1'r_0_68 + 1'p_1_68= 1
invariant : -1'p_0_29 + -1'r_0_29 + 1'r_1_29= 0
invariant : -1'p_0_93 + -1'r_0_93 + 1'r_1_93= 0
invariant : -1'p_0_47 + -1'r_0_47 + 1'r_1_47= 0
invariant : 1'p_0_21 + 1'r_0_21 + 1'p_1_21= 1
invariant : -1'p_0_54 + -1'r_0_54 + 1'r_1_54= 0
invariant : -1'p_0_40 + -1'r_0_40 + 1'r_1_40= 0
invariant : 1'p_0_12 + 1'r_0_12 + 1'p_1_12= 1
invariant : 1'p_0_14 + 1'r_0_14 + 1'p_1_14= 1
invariant : 1'p_0_94 + 1'r_0_94 + 1'p_1_94= 1
invariant : -1'p_0_61 + -1'r_0_61 + 1'r_1_61= 0
invariant : -1'p_0_67 + -1'r_0_67 + 1'r_1_67= 0
invariant : -1'p_0_43 + -1'r_0_43 + 1'r_1_43= 0
invariant : 1'p_0_20 + 1'r_0_20 + 1'p_1_20= 1
invariant : -1'p_0_26 + -1'r_0_26 + 1'r_1_26= 0
invariant : -1'p_0_30 + -1'r_0_30 + 1'r_1_30= 0
invariant : 1'p_0_16 + 1'r_0_16 + 1'p_1_16= 1
invariant : 1'p_0_97 + 1'r_0_97 + 1'p_1_97= 1
invariant : -1'p_0_64 + -1'r_0_64 + 1'r_1_64= 0
invariant : 1'p_0_43 + 1'r_0_43 + 1'p_1_43= 1
invariant : -1'p_0_68 + -1'r_0_68 + 1'r_1_68= 0
invariant : 1'p_0_17 + 1'r_0_17 + 1'p_1_17= 1
invariant : -1'p_0_55 + -1'r_0_55 + 1'r_1_55= 0
invariant : 1'p_0_83 + 1'r_0_83 + 1'p_1_83= 1
invariant : 1'p_0_18 + 1'r_0_18 + 1'p_1_18= 1
invariant : 1'p_0_3 + 1'r_0_3 + 1'p_1_3= 1
invariant : 1'p_0_10 + 1'r_0_10 + 1'p_1_10= 1
invariant : 1'p_0_67 + 1'r_0_67 + 1'p_1_67= 1
invariant : -1'p_0_20 + -1'r_0_20 + 1'r_1_20= 0
invariant : -1'p_0_1 + -1'r_0_1 + 1'r_1_1= 0
invariant : 1'p_0_70 + 1'r_0_70 + 1'p_1_70= 1
invariant : 1'p_0_66 + 1'r_0_66 + 1'p_1_66= 1
invariant : -1'p_0_7 + -1'r_0_7 + 1'r_1_7= 0
invariant : -1'p_0_19 + -1'r_0_19 + 1'r_1_19= 0
invariant : -1'p_0_48 + -1'r_0_48 + 1'r_1_48= 0
invariant : 1'p_0_11 + 1'r_0_11 + 1'p_1_11= 1
invariant : -1'p_0_60 + -1'r_0_60 + 1'r_1_60= 0
invariant : 1'p_0_84 + 1'r_0_84 + 1'p_1_84= 1
invariant : 1'p_0_78 + 1'r_0_78 + 1'p_1_78= 1
invariant : 1'p_0_37 + 1'r_0_37 + 1'p_1_37= 1
invariant : 1'p_0_76 + 1'r_0_76 + 1'p_1_76= 1
invariant : -1'p_0_18 + -1'r_0_18 + 1'r_1_18= 0
invariant : 1'p_0_48 + 1'r_0_48 + 1'p_1_48= 1
invariant : -1'p_0_83 + -1'r_0_83 + 1'r_1_83= 0
invariant : 1'p_0_29 + 1'r_0_29 + 1'p_1_29= 1
invariant : -1'p_0_6 + -1'r_0_6 + 1'r_1_6= 0
invariant : 1'p_0_80 + 1'r_0_80 + 1'p_1_80= 1
invariant : -1'p_0_63 + -1'r_0_63 + 1'r_1_63= 0
invariant : 1'p_0_49 + 1'r_0_49 + 1'p_1_49= 1
invariant : 1'p_0_82 + 1'r_0_82 + 1'p_1_82= 1
invariant : 1'p_0_54 + 1'r_0_54 + 1'p_1_54= 1
invariant : -1'p_0_12 + -1'r_0_12 + 1'r_1_12= 0
invariant : -1'p_0_97 + -1'r_0_97 + 1'r_1_97= 0
invariant : 1'p_0_31 + 1'r_0_31 + 1'p_1_31= 1
invariant : 1'p_0_13 + 1'r_0_13 + 1'p_1_13= 1
invariant : -1'p_0_82 + -1'r_0_82 + 1'r_1_82= 0
invariant : -1'p_0_17 + -1'r_0_17 + 1'r_1_17= 0
invariant : 1'p_0_95 + 1'r_0_95 + 1'p_1_95= 1
invariant : -1'p_0_70 + -1'r_0_70 + 1'r_1_70= 0
invariant : 1'p_0_74 + 1'r_0_74 + 1'p_1_74= 1
invariant : 1'p_0_98 + 1'r_0_98 + 1'p_1_98= 1
invariant : 1'p_0_38 + 1'r_0_38 + 1'p_1_38= 1
invariant : -1'p_0_81 + -1'r_0_81 + 1'r_1_81= 0
invariant : -1'p_0_33 + -1'r_0_33 + 1'r_1_33= 0
invariant : 1'p_0_63 + 1'r_0_63 + 1'p_1_63= 1
invariant : 1'p_0_26 + 1'r_0_26 + 1'p_1_26= 1
invariant : -1'p_0_10 + -1'r_0_10 + 1'r_1_10= 0
invariant : -1'p_0_46 + -1'r_0_46 + 1'r_1_46= 0
invariant : -1'p_0_15 + -1'r_0_15 + 1'r_1_15= 0
invariant : 1'p_0_85 + 1'r_0_85 + 1'p_1_85= 1
invariant : -1'p_0_71 + -1'r_0_71 + 1'r_1_71= 0
invariant : -1'p_0_24 + -1'r_0_24 + 1'r_1_24= 0
invariant : 1'p_0_59 + 1'r_0_59 + 1'p_1_59= 1
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
Exit code :0
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Exit code :0
Exit code :1
FORMULA ResAllocation-PT-R100C002-LTLCardinality-0 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :0
FORMULA ResAllocation-PT-R100C002-LTLCardinality-1 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA ResAllocation-PT-R100C002-LTLCardinality-2 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA ResAllocation-PT-R100C002-LTLCardinality-3 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA ResAllocation-PT-R100C002-LTLCardinality-4 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA ResAllocation-PT-R100C002-LTLCardinality-5 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :0
FORMULA ResAllocation-PT-R100C002-LTLCardinality-6 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA ResAllocation-PT-R100C002-LTLCardinality-7 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA ResAllocation-PT-R100C002-LTLCardinality-8 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA ResAllocation-PT-R100C002-LTLCardinality-9 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA ResAllocation-PT-R100C002-LTLCardinality-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA ResAllocation-PT-R100C002-LTLCardinality-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :0
FORMULA ResAllocation-PT-R100C002-LTLCardinality-12 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA ResAllocation-PT-R100C002-LTLCardinality-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
17442 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,174.507,2210648,1,0,3562,1.17764e+07,22,6721,5612,1.65214e+07,10157
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ResAllocation-PT-R100C002-LTLCardinality-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !(("p_1_70<=r_0_48"))
Formula 1 simplified : !"p_1_70<=r_0_48"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
12 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,174.613,2210648,1,0,3562,1.17764e+07,26,6721,6908,1.65214e+07,10163
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA ResAllocation-PT-R100C002-LTLCardinality-1 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((F(G(G(X("p_0_74>=2"))))))
Formula 2 simplified : !FGX"p_0_74>=2"
2 unique states visited
1 strongly connected components in search stack
3 transitions explored
2 items max in DFS search stack
76 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,175.377,2210708,1,0,3562,1.17764e+07,36,6721,7310,1.65214e+07,10172
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ResAllocation-PT-R100C002-LTLCardinality-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((X(F(F(G("p_0_69>=1"))))))
Formula 3 simplified : !XFG"p_0_69>=1"
Exit code :1
FORMULA ResAllocation-PT-R100C002-LTLCardinality-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
39539 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,570.772,3200284,1,0,12328,1.72124e+07,20,12295,5604,2.73517e+07,20647
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA ResAllocation-PT-R100C002-LTLCardinality-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !(("p_1_40>=2"))
Formula 4 simplified : !"p_1_40>=2"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
4524 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,616.004,3246940,1,0,12332,1.73332e+07,17,12301,6004,2.75065e+07,10
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA ResAllocation-PT-R100C002-LTLCardinality-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !(("p_0_86>=1"))
Formula 5 simplified : !"p_0_86>=1"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
6 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,616.06,3246940,1,0,12332,1.73332e+07,21,12301,7298,2.75065e+07,19
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA ResAllocation-PT-R100C002-LTLCardinality-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !(("p_0_47<=r_1_51"))
Formula 6 simplified : !"p_0_47<=r_1_51"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 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,616.061,3246940,1,0,12332,1.73332e+07,24,12301,7301,2.75065e+07,21
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA ResAllocation-PT-R100C002-LTLCardinality-6 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !(("p_1_52>=2"))
Formula 7 simplified : !"p_1_52>=2"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 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,616.061,3246940,1,0,12332,1.73332e+07,27,12301,7303,2.75065e+07,23
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA ResAllocation-PT-R100C002-LTLCardinality-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !(((F(G("p_1_33>=2")))U(X("r_0_31<=r_0_0"))))
Formula 8 simplified : !(FG"p_1_33>=2" U X"r_0_31<=r_0_0")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
8056 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,696.633,3247212,1,0,12332,1.73332e+07,43,12905,7308,2.75065e+07,36082
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA ResAllocation-PT-R100C002-LTLCardinality-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((G(F(X(G("r_1_78<=p_1_0"))))))
Formula 9 simplified : !GFXG"r_1_78<=p_1_0"
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
824 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,704.866,3403076,1,0,12332,1.73332e+07,56,13376,7312,2.75065e+07,36951
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA ResAllocation-PT-R100C002-LTLCardinality-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((G(X(("p_0_12>=2")U("p_0_48<=p_1_89")))))
Formula 10 simplified : !GX("p_0_12>=2" U "p_0_48<=p_1_89")
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
31 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,705.181,3410764,1,0,12332,1.73332e+07,66,13378,7323,2.75065e+07,36960
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA ResAllocation-PT-R100C002-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !(((X("r_1_50<=p_1_97"))U(("p_1_57<=p_1_95")U("p_1_80>=2"))))
Formula 11 simplified : !(X"r_1_50<=p_1_97" U ("p_1_57<=p_1_95" U "p_1_80>=2"))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
29206 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,997.246,3965032,1,0,12332,2.05435e+07,31,13627,6021,2.95137e+07,9082
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA ResAllocation-PT-R100C002-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((F("r_0_13<=p_1_31")))
Formula 12 simplified : !F"r_0_13<=p_1_31"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
4385 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,1041.09,3965032,1,0,15838,2.05435e+07,41,13627,7319,2.95137e+07,33467
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA ResAllocation-PT-R100C002-LTLCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((G(F("p_0_29>=1"))))
Formula 13 simplified : !GF"p_0_29>=1"
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
12805 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,1169.13,4360104,1,0,18115,2.35792e+07,17,15034,5604,3.24339e+07,20652
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA ResAllocation-PT-R100C002-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((G(F(F(F("p_1_65<=r_0_30"))))))
Formula 14 simplified : !GF"p_1_65<=r_0_30"
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
34746 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,1516.6,4776308,1,0,18115,3.02549e+07,17,15034,5528,3.24339e+07,5947
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA ResAllocation-PT-R100C002-LTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((X(F(X(F("r_0_8>=3"))))))
Formula 15 simplified : !XFXF"r_0_8>=3"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
19016 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,1706.76,5253820,1,0,18115,3.15188e+07,17,15034,5604,3.34839e+07,22350
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA ResAllocation-PT-R100C002-LTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Exit code :0
BK_STOP 1496655675706
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
+ ulimit -s 65536
+ java -Dosgi.requiredJavaVersion=1.6 -Xss8m -Xms40m -Xmx8192m -Declipse.pde.launch=true -Dfile.encoding=UTF-8 -classpath /home/mcc/BenchKit//eclipse/plugins/org.eclipse.equinox.launcher_1.3.201.v20161025-1711.jar org.eclipse.equinox.launcher.Main -application fr.lip6.move.gal.application.pnmcc -data /home/mcc/BenchKit//workspace -os linux -ws gtk -arch x86_64 -nl en_US -consoleLog -pnfolder /home/mcc/execution -examination LTLCardinality -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
Jun 05, 2017 9:12:03 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 05, 2017 9:12:03 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 129 ms
Jun 05, 2017 9:12:03 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 400 places.
Jun 05, 2017 9:12:03 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 202 transitions.
Jun 05, 2017 9:12:03 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 108 ms
Jun 05, 2017 9:12:03 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 30 ms
Jun 05, 2017 9:12:03 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 0 ms
Jun 05, 2017 9:12:04 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 200 place invariants in 117 ms
Jun 05, 2017 9:12:16 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 400 variables to be positive in 12292 ms
Jun 05, 2017 9:12:16 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 202 transitions.
Jun 05, 2017 9:12:16 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :0/202 took 13 ms. Total solver calls (SAT/UNSAT): 4(2/2)
Jun 05, 2017 9:12:17 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :71/202 took 1023 ms. Total solver calls (SAT/UNSAT): 359(144/215)
Jun 05, 2017 9:12:18 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :148/202 took 2024 ms. Total solver calls (SAT/UNSAT): 738(296/442)
Jun 05, 2017 9:12:19 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 2709 ms. Total solver calls (SAT/UNSAT): 1002(402/600)
Jun 05, 2017 9:12:19 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 202 transitions.
Jun 05, 2017 9:12:20 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :54/202 took 1008 ms. Total solver calls (SAT/UNSAT): 274(110/164)
Jun 05, 2017 9:12:21 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :105/202 took 2025 ms. Total solver calls (SAT/UNSAT): 523(210/313)
Jun 05, 2017 9:12:22 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :159/202 took 3029 ms. Total solver calls (SAT/UNSAT): 793(318/475)
Jun 05, 2017 9:12:22 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 3781 ms. Total solver calls (SAT/UNSAT): 1002(402/600)
Jun 05, 2017 9:12:23 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 202 transitions.
Jun 05, 2017 9:12:24 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(1/202) took 1281 ms. Total solver calls (SAT/UNSAT): 403(396/7)
Jun 05, 2017 9:12:25 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(3/202) took 2445 ms. Total solver calls (SAT/UNSAT): 802(787/15)
Jun 05, 2017 9:12:26 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(5/202) took 3587 ms. Total solver calls (SAT/UNSAT): 1197(1174/23)
Jun 05, 2017 9:12:27 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(7/202) took 4714 ms. Total solver calls (SAT/UNSAT): 1588(1557/31)
Jun 05, 2017 9:12:28 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(9/202) took 5826 ms. Total solver calls (SAT/UNSAT): 1975(1936/39)
Jun 05, 2017 9:12:29 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(11/202) took 6933 ms. Total solver calls (SAT/UNSAT): 2358(2311/47)
Jun 05, 2017 9:12:31 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(13/202) took 8018 ms. Total solver calls (SAT/UNSAT): 2737(2682/55)
Jun 05, 2017 9:12:32 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(15/202) took 9086 ms. Total solver calls (SAT/UNSAT): 3112(3049/63)
Jun 05, 2017 9:12:33 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(17/202) took 10150 ms. Total solver calls (SAT/UNSAT): 3483(3412/71)
Jun 05, 2017 9:12:34 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(19/202) took 11178 ms. Total solver calls (SAT/UNSAT): 3850(3771/79)
Jun 05, 2017 9:12:35 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(21/202) took 12192 ms. Total solver calls (SAT/UNSAT): 4213(4126/87)
Jun 05, 2017 9:12:36 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(23/202) took 13192 ms. Total solver calls (SAT/UNSAT): 4572(4477/95)
Jun 05, 2017 9:12:37 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(26/202) took 14686 ms. Total solver calls (SAT/UNSAT): 5103(4996/107)
Jun 05, 2017 9:12:39 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(29/202) took 16152 ms. Total solver calls (SAT/UNSAT): 5625(5506/119)
Jun 05, 2017 9:12:40 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(32/202) took 17596 ms. Total solver calls (SAT/UNSAT): 6138(6007/131)
Jun 05, 2017 9:12:42 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(35/202) took 19056 ms. Total solver calls (SAT/UNSAT): 6642(6499/143)
Jun 05, 2017 9:12:43 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(38/202) took 20499 ms. Total solver calls (SAT/UNSAT): 7137(6982/155)
Jun 05, 2017 9:12:44 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(41/202) took 21931 ms. Total solver calls (SAT/UNSAT): 7623(7456/167)
Jun 05, 2017 9:12:46 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(44/202) took 23335 ms. Total solver calls (SAT/UNSAT): 8100(7921/179)
Jun 05, 2017 9:12:47 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(47/202) took 24711 ms. Total solver calls (SAT/UNSAT): 8568(8377/191)
Jun 05, 2017 9:12:49 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(50/202) took 26052 ms. Total solver calls (SAT/UNSAT): 9027(8824/203)
Jun 05, 2017 9:12:50 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(53/202) took 27370 ms. Total solver calls (SAT/UNSAT): 9477(9262/215)
Jun 05, 2017 9:12:51 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(56/202) took 28645 ms. Total solver calls (SAT/UNSAT): 9918(9691/227)
Jun 05, 2017 9:12:52 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(59/202) took 29907 ms. Total solver calls (SAT/UNSAT): 10350(10111/239)
Jun 05, 2017 9:12:54 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(62/202) took 31147 ms. Total solver calls (SAT/UNSAT): 10773(10522/251)
Jun 05, 2017 9:12:55 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(65/202) took 32356 ms. Total solver calls (SAT/UNSAT): 11187(10924/263)
Jun 05, 2017 9:12:56 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(68/202) took 33539 ms. Total solver calls (SAT/UNSAT): 11592(11317/275)
Jun 05, 2017 9:12:57 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(71/202) took 34679 ms. Total solver calls (SAT/UNSAT): 11988(11701/287)
Jun 05, 2017 9:12:58 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(74/202) took 35775 ms. Total solver calls (SAT/UNSAT): 12375(12076/299)
Jun 05, 2017 9:12:59 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(77/202) took 36846 ms. Total solver calls (SAT/UNSAT): 12753(12442/311)
Jun 05, 2017 9:13:00 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(80/202) took 37891 ms. Total solver calls (SAT/UNSAT): 13122(12799/323)
Jun 05, 2017 9:13:02 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(84/202) took 39218 ms. Total solver calls (SAT/UNSAT): 13600(13261/339)
Jun 05, 2017 9:13:03 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(88/202) took 40505 ms. Total solver calls (SAT/UNSAT): 14062(13707/355)
Jun 05, 2017 9:13:04 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(92/202) took 41724 ms. Total solver calls (SAT/UNSAT): 14508(14137/371)
Jun 05, 2017 9:13:05 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(96/202) took 42915 ms. Total solver calls (SAT/UNSAT): 14938(14551/387)
Jun 05, 2017 9:13:07 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(100/202) took 44082 ms. Total solver calls (SAT/UNSAT): 15352(14950/402)
Jun 05, 2017 9:13:08 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(104/202) took 45226 ms. Total solver calls (SAT/UNSAT): 15750(15340/410)
Jun 05, 2017 9:13:09 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(108/202) took 46338 ms. Total solver calls (SAT/UNSAT): 16132(15714/418)
Jun 05, 2017 9:13:10 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(112/202) took 47417 ms. Total solver calls (SAT/UNSAT): 16498(16072/426)
Jun 05, 2017 9:13:11 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(116/202) took 48422 ms. Total solver calls (SAT/UNSAT): 16848(16414/434)
Jun 05, 2017 9:13:12 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(121/202) took 49631 ms. Total solver calls (SAT/UNSAT): 17263(16819/444)
Jun 05, 2017 9:13:13 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(126/202) took 50744 ms. Total solver calls (SAT/UNSAT): 17653(17199/454)
Jun 05, 2017 9:13:14 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(131/202) took 51750 ms. Total solver calls (SAT/UNSAT): 18018(17554/464)
Jun 05, 2017 9:13:15 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(137/202) took 52856 ms. Total solver calls (SAT/UNSAT): 18423(17947/476)
Jun 05, 2017 9:13:16 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(143/202) took 53871 ms. Total solver calls (SAT/UNSAT): 18792(18304/488)
Jun 05, 2017 9:13:17 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(150/202) took 54939 ms. Total solver calls (SAT/UNSAT): 19177(18675/502)
Jun 05, 2017 9:13:19 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(158/202) took 55983 ms. Total solver calls (SAT/UNSAT): 19557(19039/518)
Jun 05, 2017 9:13:20 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(168/202) took 57031 ms. Total solver calls (SAT/UNSAT): 19942(19404/538)
Jun 05, 2017 9:13:21 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(182/202) took 58065 ms. Total solver calls (SAT/UNSAT): 20313(19747/566)
Jun 05, 2017 9:13:21 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished enabling matrix. took 58560 ms. Total solver calls (SAT/UNSAT): 20503(19900/603)
Jun 05, 2017 9:13:21 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeDoNotAccord
INFO: Computing Do-Not-Accords matrix : 202 transitions.
Jun 05, 2017 9:13:21 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 05, 2017 9:13:21 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 77841ms conformant to PINS in folder :/home/mcc/execution
Jun 05, 2017 9:13:25 AM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, -p, --pins-guards, --when, --ltl, ([](<>((LTLAP0==true))))U(((LTLAP1==true))U((LTLAP2==true)))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.001: Registering PINS so language module
pins2lts-seq, 0.001: Loading model from ./gal.so
pins2lts-seq, 0.001: library has no initializer
pins2lts-seq, 0.001: loading model GAL
pins2lts-seq, 0.007: completed loading model GAL
pins2lts-seq, 0.007: Initializing POR dependencies: labels 224, guards 202
pins2lts-seq, 0.121: LTL layer: formula: ([](<>((LTLAP0==true))))U(((LTLAP1==true))U((LTLAP2==true)))
pins2lts-seq, 0.121: Expression is: (([] (<> (LTLAP0 == true ))) U ((LTLAP1 == true ) U (LTLAP2 == true )))
pins2lts-seq, 0.122: buchi has 5 states
pins2lts-seq, 0.122: state 0: accepting
pins2lts-seq, 0.122: -> 1, | !(LTLAP2 == true ) && !(LTLAP1 == true ) && !(LTLAP0 == true )
pins2lts-seq, 0.122: -> 2, | !(LTLAP2 == true ) && !(LTLAP1 == true )
pins2lts-seq, 0.122: -> 0, | !(LTLAP2 == true )
pins2lts-seq, 0.122: -> 3, | !(LTLAP2 == true ) && !(LTLAP0 == true )
pins2lts-seq, 0.122: -> 4, | !(LTLAP2 == true )
pins2lts-seq, 0.122: state 1: accepting
pins2lts-seq, 0.122: -> 1, | !(LTLAP0 == true )
pins2lts-seq, 0.122: state 2: non-accepting
pins2lts-seq, 0.122: -> 2, | true
pins2lts-seq, 0.122: -> 1, | !(LTLAP0 == true )
pins2lts-seq, 0.122: state 3: accepting
pins2lts-seq, 0.122: -> 3, | !(LTLAP2 == true ) && !(LTLAP0 == true )
pins2lts-seq, 0.122: -> 1, | !(LTLAP2 == true ) && !(LTLAP1 == true ) && !(LTLAP0 == true )
pins2lts-seq, 0.122: state 4: non-accepting
pins2lts-seq, 0.122: -> 4, | !(LTLAP2 == true )
pins2lts-seq, 0.122: -> 3, | !(LTLAP2 == true ) && !(LTLAP0 == true )
pins2lts-seq, 0.122: -> 2, | !(LTLAP2 == true ) && !(LTLAP1 == true )
pins2lts-seq, 0.122: -> 1, | !(LTLAP2 == true ) && !(LTLAP1 == true ) && !(LTLAP0 == true )
pins2lts-seq, 0.124: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.125: There are 225 state labels and 1 edge labels
pins2lts-seq, 0.125: State length is 401, there are 216 groups
pins2lts-seq, 0.125: Running scc search strategy
pins2lts-seq, 0.125: Using a tree for state storage
pins2lts-seq, 0.125: Visible groups: 913 / 216, labels: 3 / 225
pins2lts-seq, 0.125: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.132: accepting cycle found!
pins2lts-seq, 0.132: exiting now
Jun 05, 2017 9:13:25 AM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, -p, --pins-guards, --when, --ltl, (LTLAP3==true)], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.002: completed loading model GAL
pins2lts-seq, 0.002: Initializing POR dependencies: labels 224, guards 202
pins2lts-seq, 0.080: LTL layer: formula: (LTLAP3==true)
pins2lts-seq, 0.080: Expression is: (LTLAP3 == true )
pins2lts-seq, 0.080: buchi has 2 states
pins2lts-seq, 0.080: state 0: accepting
pins2lts-seq, 0.080: -> 1, | !(LTLAP3 == true )
pins2lts-seq, 0.080: state 1: accepting
pins2lts-seq, 0.080: -> 1, | true
pins2lts-seq, 0.082: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.084: There are 225 state labels and 1 edge labels
pins2lts-seq, 0.084: State length is 401, there are 204 groups
pins2lts-seq, 0.084: Running scc search strategy
pins2lts-seq, 0.084: Using a tree for state storage
pins2lts-seq, 0.084: Visible groups: 0 / 204, labels: 1 / 225
pins2lts-seq, 0.084: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.085: state space 1 levels, 1 states 0 transitions
Jun 05, 2017 9:13:26 AM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, --when, --ltl, <>([]([](X((LTLAP4==true)))))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.002: completed loading model GAL
pins2lts-seq, 0.003: LTL layer: formula: <>([]([](X((LTLAP4==true)))))
pins2lts-seq, 0.003: Expression is: (<> ([] ([] (X (LTLAP4 == true )))))
pins2lts-seq, 0.003: buchi has 4 states
pins2lts-seq, 0.003: state 0: accepting
pins2lts-seq, 0.003: -> 1, | true
pins2lts-seq, 0.003: -> 0, | !(LTLAP4 == true )
pins2lts-seq, 0.003: -> 2, | true
pins2lts-seq, 0.003: state 1: non-accepting
pins2lts-seq, 0.003: -> 1, | true
pins2lts-seq, 0.003: -> 0, | !(LTLAP4 == true )
pins2lts-seq, 0.003: state 2: non-accepting
pins2lts-seq, 0.003: -> 3, | true
pins2lts-seq, 0.003: -> 0, | !(LTLAP4 == true )
pins2lts-seq, 0.003: -> 2, | true
pins2lts-seq, 0.003: state 3: accepting
pins2lts-seq, 0.003: -> 1, | true
pins2lts-seq, 0.003: -> 0, | !(LTLAP4 == true )
pins2lts-seq, 0.007: There are 225 state labels and 1 edge labels
pins2lts-seq, 0.007: State length is 401, there are 212 groups
pins2lts-seq, 0.007: Running scc search strategy
pins2lts-seq, 0.007: Using a tree for state storage
pins2lts-seq, 0.617: accepting cycle found!
pins2lts-seq, 0.617: exiting now
Jun 05, 2017 9:13:26 AM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, --when, --ltl, X(<>(<>([]((LTLAP5==true)))))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.005: completed loading model GAL
pins2lts-seq, 0.005: LTL layer: formula: X(<>(<>([]((LTLAP5==true)))))
pins2lts-seq, 0.005: Expression is: (X (<> (<> ([] (LTLAP5 == true )))))
pins2lts-seq, 0.005: buchi has 2 states
pins2lts-seq, 0.005: state 0: non-accepting
pins2lts-seq, 0.005: -> 1, | !(LTLAP5 == true )
pins2lts-seq, 0.005: -> 0, | true
pins2lts-seq, 0.005: state 1: accepting
pins2lts-seq, 0.005: -> 1, | !(LTLAP5 == true )
pins2lts-seq, 0.005: -> 0, | true
pins2lts-seq, 0.013: There are 225 state labels and 1 edge labels
pins2lts-seq, 0.013: State length is 401, there are 206 groups
pins2lts-seq, 0.013: Running scc search strategy
pins2lts-seq, 0.013: Using a tree for state storage
pins2lts-seq, 0.403: accepting cycle found!
pins2lts-seq, 0.403: exiting now
Jun 05, 2017 9:13:27 AM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, -p, --pins-guards, --when, --ltl, (LTLAP6==true)], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.002: completed loading model GAL
pins2lts-seq, 0.002: Initializing POR dependencies: labels 224, guards 202
pins2lts-seq, 0.080: LTL layer: formula: (LTLAP6==true)
pins2lts-seq, 0.080: Expression is: (LTLAP6 == true )
pins2lts-seq, 0.080: buchi has 2 states
pins2lts-seq, 0.080: state 0: accepting
pins2lts-seq, 0.080: -> 1, | !(LTLAP6 == true )
pins2lts-seq, 0.080: state 1: accepting
pins2lts-seq, 0.080: -> 1, | true
pins2lts-seq, 0.082: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.083: There are 225 state labels and 1 edge labels
pins2lts-seq, 0.083: State length is 401, there are 204 groups
pins2lts-seq, 0.083: Running scc search strategy
pins2lts-seq, 0.083: Using a tree for state storage
pins2lts-seq, 0.083: Visible groups: 0 / 204, labels: 1 / 225
pins2lts-seq, 0.083: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.090: accepting cycle found!
pins2lts-seq, 0.090: exiting now
Jun 05, 2017 9:13:27 AM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, -p, --pins-guards, --when, --ltl, (LTLAP7==true)], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.002: completed loading model GAL
pins2lts-seq, 0.002: Initializing POR dependencies: labels 224, guards 202
pins2lts-seq, 0.080: LTL layer: formula: (LTLAP7==true)
pins2lts-seq, 0.080: Expression is: (LTLAP7 == true )
pins2lts-seq, 0.080: buchi has 2 states
pins2lts-seq, 0.080: state 0: accepting
pins2lts-seq, 0.080: -> 1, | !(LTLAP7 == true )
pins2lts-seq, 0.080: state 1: accepting
pins2lts-seq, 0.080: -> 1, | true
pins2lts-seq, 0.082: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.084: There are 225 state labels and 1 edge labels
pins2lts-seq, 0.084: State length is 401, there are 204 groups
pins2lts-seq, 0.084: Running scc search strategy
pins2lts-seq, 0.084: Using a tree for state storage
pins2lts-seq, 0.084: Visible groups: 0 / 204, labels: 1 / 225
pins2lts-seq, 0.084: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.090: accepting cycle found!
pins2lts-seq, 0.090: exiting now
Jun 05, 2017 9:13:27 AM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, -p, --pins-guards, --when, --ltl, (LTLAP8==true)], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.002: completed loading model GAL
pins2lts-seq, 0.002: Initializing POR dependencies: labels 224, guards 202
pins2lts-seq, 0.080: LTL layer: formula: (LTLAP8==true)
pins2lts-seq, 0.081: Expression is: (LTLAP8 == true )
pins2lts-seq, 0.081: buchi has 2 states
pins2lts-seq, 0.081: state 0: accepting
pins2lts-seq, 0.081: -> 1, | !(LTLAP8 == true )
pins2lts-seq, 0.081: state 1: accepting
pins2lts-seq, 0.081: -> 1, | true
pins2lts-seq, 0.083: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.084: There are 225 state labels and 1 edge labels
pins2lts-seq, 0.084: State length is 401, there are 204 groups
pins2lts-seq, 0.084: Running scc search strategy
pins2lts-seq, 0.084: Using a tree for state storage
pins2lts-seq, 0.084: Visible groups: 0 / 204, labels: 1 / 225
pins2lts-seq, 0.084: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.086: state space 1 levels, 1 states 0 transitions
Jun 05, 2017 9:13:27 AM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, -p, --pins-guards, --when, --ltl, (LTLAP9==true)], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.002: completed loading model GAL
pins2lts-seq, 0.002: Initializing POR dependencies: labels 224, guards 202
pins2lts-seq, 0.081: LTL layer: formula: (LTLAP9==true)
pins2lts-seq, 0.081: Expression is: (LTLAP9 == true )
pins2lts-seq, 0.081: buchi has 2 states
pins2lts-seq, 0.081: state 0: accepting
pins2lts-seq, 0.081: -> 1, | !(LTLAP9 == true )
pins2lts-seq, 0.081: state 1: accepting
pins2lts-seq, 0.081: -> 1, | true
pins2lts-seq, 0.083: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.084: There are 225 state labels and 1 edge labels
pins2lts-seq, 0.084: State length is 401, there are 204 groups
pins2lts-seq, 0.084: Running scc search strategy
pins2lts-seq, 0.084: Using a tree for state storage
pins2lts-seq, 0.084: Visible groups: 0 / 204, labels: 1 / 225
pins2lts-seq, 0.084: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.091: accepting cycle found!
pins2lts-seq, 0.091: exiting now
Jun 05, 2017 9:13:27 AM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, --when, --ltl, (<>([]((LTLAP10==true))))U(X((LTLAP11==true)))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.002: completed loading model GAL
pins2lts-seq, 0.002: LTL layer: formula: (<>([]((LTLAP10==true))))U(X((LTLAP11==true)))
pins2lts-seq, 0.003: Expression is: ((<> ([] (LTLAP10 == true ))) U (X (LTLAP11 == true )))
pins2lts-seq, 0.003: buchi has 5 states
pins2lts-seq, 0.003: state 0: non-accepting
pins2lts-seq, 0.003: -> 1, | true
pins2lts-seq, 0.003: -> 2, | true
pins2lts-seq, 0.003: state 1: accepting
pins2lts-seq, 0.003: -> 1, | !(LTLAP11 == true )
pins2lts-seq, 0.003: -> 2, | !(LTLAP11 == true )
pins2lts-seq, 0.003: state 2: non-accepting
pins2lts-seq, 0.003: -> 3, | !(LTLAP11 == true )
pins2lts-seq, 0.003: state 3: non-accepting
pins2lts-seq, 0.003: -> 3, | true
pins2lts-seq, 0.003: -> 4, | !(LTLAP10 == true )
pins2lts-seq, 0.003: state 4: accepting
pins2lts-seq, 0.003: -> 3, | true
pins2lts-seq, 0.003: -> 4, | !(LTLAP10 == true )
pins2lts-seq, 0.007: There are 225 state labels and 1 edge labels
pins2lts-seq, 0.007: State length is 401, there are 211 groups
pins2lts-seq, 0.007: Running scc search strategy
pins2lts-seq, 0.007: Using a tree for state storage
pins2lts-seq, 0.424: accepting cycle found!
pins2lts-seq, 0.424: exiting now
Jun 05, 2017 9:13:28 AM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, --when, --ltl, [](<>(X([]((LTLAP12==true)))))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.002: completed loading model GAL
pins2lts-seq, 0.002: LTL layer: formula: [](<>(X([]((LTLAP12==true)))))
pins2lts-seq, 0.003: Expression is: ([] (<> (X ([] (LTLAP12 == true )))))
pins2lts-seq, 0.003: buchi has 2 states
pins2lts-seq, 0.003: state 0: non-accepting
pins2lts-seq, 0.003: -> 1, | !(LTLAP12 == true )
pins2lts-seq, 0.003: -> 0, | true
pins2lts-seq, 0.003: state 1: accepting
pins2lts-seq, 0.003: -> 1, | !(LTLAP12 == true )
pins2lts-seq, 0.003: -> 0, | true
pins2lts-seq, 0.007: There are 225 state labels and 1 edge labels
pins2lts-seq, 0.007: State length is 401, there are 206 groups
pins2lts-seq, 0.007: Running scc search strategy
pins2lts-seq, 0.007: Using a tree for state storage
pins2lts-seq, 0.436: accepting cycle found!
pins2lts-seq, 0.436: exiting now
Jun 05, 2017 9:13:28 AM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, --when, --ltl, [](X(((LTLAP13==true))U((LTLAP14==true))))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.002: completed loading model GAL
pins2lts-seq, 0.002: LTL layer: formula: [](X(((LTLAP13==true))U((LTLAP14==true))))
pins2lts-seq, 0.002: Expression is: ([] (X ((LTLAP13 == true ) U (LTLAP14 == true ))))
pins2lts-seq, 0.003: buchi has 4 states
pins2lts-seq, 0.003: state 0: non-accepting
pins2lts-seq, 0.003: -> 1, | true
pins2lts-seq, 0.003: state 1: non-accepting
pins2lts-seq, 0.003: -> 1, | true
pins2lts-seq, 0.003: -> 2, | !(LTLAP14 == true ) && !(LTLAP13 == true )
pins2lts-seq, 0.003: -> 3, | !(LTLAP14 == true )
pins2lts-seq, 0.003: state 2: accepting
pins2lts-seq, 0.003: -> 2, | true
pins2lts-seq, 0.003: state 3: accepting
pins2lts-seq, 0.003: -> 3, | !(LTLAP14 == true )
pins2lts-seq, 0.003: -> 2, | !(LTLAP14 == true ) && !(LTLAP13 == true )
pins2lts-seq, 0.007: There are 225 state labels and 1 edge labels
pins2lts-seq, 0.007: State length is 401, there are 209 groups
pins2lts-seq, 0.007: Running scc search strategy
pins2lts-seq, 0.007: Using a tree for state storage
pins2lts-seq, 0.282: accepting cycle found!
pins2lts-seq, 0.282: exiting now
Jun 05, 2017 9:13:28 AM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, --when, --ltl, (X((LTLAP15==true)))U(((LTLAP16==true))U((LTLAP17==true)))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.002: completed loading model GAL
pins2lts-seq, 0.002: LTL layer: formula: (X((LTLAP15==true)))U(((LTLAP16==true))U((LTLAP17==true)))
pins2lts-seq, 0.003: Expression is: ((X (LTLAP15 == true )) U ((LTLAP16 == true ) U (LTLAP17 == true )))
pins2lts-seq, 0.003: buchi has 5 states
pins2lts-seq, 0.003: state 0: accepting
pins2lts-seq, 0.003: -> 1, | !(LTLAP17 == true ) && !(LTLAP16 == true )
pins2lts-seq, 0.003: -> 0, | !(LTLAP17 == true )
pins2lts-seq, 0.003: -> 3, | !(LTLAP17 == true )
pins2lts-seq, 0.003: state 1: accepting
pins2lts-seq, 0.003: -> 2, | !(LTLAP15 == true )
pins2lts-seq, 0.003: state 2: accepting
pins2lts-seq, 0.003: -> 2, | true
pins2lts-seq, 0.003: state 3: accepting
pins2lts-seq, 0.003: -> 4, | !(LTLAP17 == true ) && !(LTLAP15 == true )
pins2lts-seq, 0.003: -> 2, | !(LTLAP17 == true ) && !(LTLAP16 == true ) && !(LTLAP15 == true )
pins2lts-seq, 0.003: state 4: accepting
pins2lts-seq, 0.003: -> 4, | !(LTLAP17 == true )
pins2lts-seq, 0.003: -> 2, | !(LTLAP17 == true ) && !(LTLAP16 == true )
pins2lts-seq, 0.007: There are 225 state labels and 1 edge labels
pins2lts-seq, 0.007: State length is 401, there are 211 groups
pins2lts-seq, 0.007: Running scc search strategy
pins2lts-seq, 0.007: Using a tree for state storage
pins2lts-seq, 0.297: accepting cycle found!
pins2lts-seq, 0.297: exiting now
Jun 05, 2017 9:13:29 AM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, -p, --pins-guards, --when, --ltl, <>((LTLAP18==true))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.002: completed loading model GAL
pins2lts-seq, 0.002: Initializing POR dependencies: labels 224, guards 202
pins2lts-seq, 0.080: LTL layer: formula: <>((LTLAP18==true))
pins2lts-seq, 0.080: Expression is: (<> (LTLAP18 == true ))
pins2lts-seq, 0.080: buchi has 1 states
pins2lts-seq, 0.080: state 0: accepting
pins2lts-seq, 0.080: -> 0, | !(LTLAP18 == true )
pins2lts-seq, 0.082: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.083: There are 225 state labels and 1 edge labels
pins2lts-seq, 0.083: State length is 401, there are 203 groups
pins2lts-seq, 0.083: Running scc search strategy
pins2lts-seq, 0.083: Using a tree for state storage
pins2lts-seq, 0.083: Visible groups: 0 / 203, labels: 1 / 225
pins2lts-seq, 0.083: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.487: state space 2439 levels, 8117 states 9000 transitions
Jun 05, 2017 9:13:29 AM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, -p, --pins-guards, --when, --ltl, [](<>((LTLAP19==true)))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.005: completed loading model GAL
pins2lts-seq, 0.005: Initializing POR dependencies: labels 224, guards 202
pins2lts-seq, 0.128: LTL layer: formula: [](<>((LTLAP19==true)))
pins2lts-seq, 0.129: Expression is: ([] (<> (LTLAP19 == true )))
pins2lts-seq, 0.129: buchi has 2 states
pins2lts-seq, 0.129: state 0: non-accepting
pins2lts-seq, 0.129: -> 0, | true
pins2lts-seq, 0.129: -> 1, | !(LTLAP19 == true )
pins2lts-seq, 0.129: state 1: accepting
pins2lts-seq, 0.129: -> 1, | !(LTLAP19 == true )
pins2lts-seq, 0.131: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.133: There are 225 state labels and 1 edge labels
pins2lts-seq, 0.133: State length is 401, there are 205 groups
pins2lts-seq, 0.133: Running scc search strategy
pins2lts-seq, 0.133: Using a tree for state storage
pins2lts-seq, 0.133: Visible groups: 0 / 205, labels: 1 / 225
pins2lts-seq, 0.133: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.268: accepting cycle found!
pins2lts-seq, 0.268: exiting now
Jun 05, 2017 9:17:14 AM fr.lip6.move.gal.itstools.ProcessController$1 run
WARNING: null
Jun 05, 2017 9:17:14 AM fr.lip6.move.gal.itstools.ProcessController forwardStream
WARNING: Stream closed
Jun 05, 2017 9:17:14 AM fr.lip6.move.gal.itstools.ProcessController forwardStream
WARNING: Stream closed
LTSmin timed out on command CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, -p, --pins-guards, --when, --ltl, [](<>(<>(<>((LTLAP20==true)))))], workingDir=/home/mcc/execution]
Jun 05, 2017 9:17:15 AM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, --when, --ltl, X(<>(X(<>((LTLAP21==true)))))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.005: completed loading model GAL
pins2lts-seq, 0.005: LTL layer: formula: X(<>(X(<>((LTLAP21==true)))))
pins2lts-seq, 0.006: Expression is: (X (<> (X (<> (LTLAP21 == true )))))
pins2lts-seq, 0.006: buchi has 3 states
pins2lts-seq, 0.006: state 0: accepting
pins2lts-seq, 0.006: -> 1, | true
pins2lts-seq, 0.006: state 1: accepting
pins2lts-seq, 0.006: -> 2, | true
pins2lts-seq, 0.006: state 2: accepting
pins2lts-seq, 0.006: -> 2, | !(LTLAP21 == true )
pins2lts-seq, 0.014: There are 225 state labels and 1 edge labels
pins2lts-seq, 0.014: State length is 401, there are 205 groups
pins2lts-seq, 0.014: Running scc search strategy
pins2lts-seq, 0.014: Using a tree for state storage
pins2lts-seq, 0.330: accepting cycle found!
pins2lts-seq, 0.330: exiting now
Jun 05, 2017 9:41:15 AM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201705302212/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
Reverse transition relation is NOT exact ! Due to transitions t_0_100, t_1_0, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/200/2/202
Computing Next relation with stutter on 99 deadlock states
Computing Next relation with stutter on 99 deadlock states
Computing Next relation with stutter on 99 deadlock states
Computing Next relation with stutter on 99 deadlock states
Computing Next relation with stutter on 99 deadlock states
Computing Next relation with stutter on 99 deadlock states
Computing Next relation with stutter on 99 deadlock states
Computing Next relation with stutter on 99 deadlock states
Computing Next relation with stutter on 99 deadlock states
Computing Next relation with stutter on 99 deadlock states
Computing Next relation with stutter on 99 deadlock states
Computing Next relation with stutter on 99 deadlock states
Computing Next relation with stutter on 99 deadlock states
Computing Next relation with stutter on 99 deadlock states
Computing Next relation with stutter on 99 deadlock states
Computing Next relation with stutter on 99 deadlock states
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="S_ResAllocation-PT-R100C002"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# 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
tar xzf /home/mcc/BenchKit/INPUTS/S_ResAllocation-PT-R100C002.tgz
mv S_ResAllocation-PT-R100C002 execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool itstools"
echo " Input is S_ResAllocation-PT-R100C002, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r150-csrt-149443434700122"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
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 ;